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.r524-tall-171679079600092.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 ltsminxred
Input is RingSingleMessageInMbox-PT-d1m080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079600092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 13 00:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 00:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:17 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-d1m080-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717218644212

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:10:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:10:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:10:45] [INFO ] Load time of PNML (sax parser for PT used): 449 ms
[2024-06-01 05:10:45] [INFO ] Transformed 6690 places.
[2024-06-01 05:10:45] [INFO ] Transformed 11934 transitions.
[2024-06-01 05:10:45] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 616 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 3 formulas.
Deduced a syphon composed of 4305 places in 37 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1086 places :
Symmetric choice reduction at 1 with 1086 rule applications. Total rules 1205 place count 1282 transition count 6525
Iterating global reduction 1 with 1086 rules applied. Total rules applied 2291 place count 1282 transition count 6525
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 1 with 255 rules applied. Total rules applied 2546 place count 1282 transition count 6270
Discarding 918 places :
Symmetric choice reduction at 2 with 918 rule applications. Total rules 3464 place count 364 transition count 5352
Iterating global reduction 2 with 918 rules applied. Total rules applied 4382 place count 364 transition count 5352
Ensure Unique test removed 4218 transitions
Reduce isomorphic transitions removed 4218 transitions.
Iterating post reduction 2 with 4218 rules applied. Total rules applied 8600 place count 364 transition count 1134
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 8667 place count 297 transition count 1067
Iterating global reduction 3 with 67 rules applied. Total rules applied 8734 place count 297 transition count 1067
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 3 with 124 rules applied. Total rules applied 8858 place count 297 transition count 943
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 8865 place count 290 transition count 936
Iterating global reduction 4 with 7 rules applied. Total rules applied 8872 place count 290 transition count 936
Applied a total of 8872 rules in 464 ms. Remains 290 /2385 variables (removed 2095) and now considering 936/11934 (removed 10998) transitions.
// Phase 1: matrix 936 rows 290 cols
[2024-06-01 05:10:46] [INFO ] Computed 3 invariants in 28 ms
[2024-06-01 05:10:47] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 05:10:47] [INFO ] Invariant cache hit.
[2024-06-01 05:10:47] [INFO ] State equation strengthened by 675 read => feed constraints.
[2024-06-01 05:10:48] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
Running 935 sub problems to find dead transitions.
[2024-06-01 05:10:48] [INFO ] Invariant cache hit.
[2024-06-01 05:10:48] [INFO ] State equation strengthened by 675 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 2 (OVERLAPS) 1/290 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 935 unsolved
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
At refinement iteration 4 (OVERLAPS) 936/1226 variables, 290/293 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1226 variables, 675/968 constraints. Problems are: Problem set: 26 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 968 constraints, problems are : Problem set: 26 solved, 909 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 290/290 constraints, ReadFeed: 675/675 constraints, PredecessorRefiner: 935/935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 1 (OVERLAPS) 17/280 variables, 2/2 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/2 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 3 (OVERLAPS) 10/290 variables, 1/3 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/3 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 5 (OVERLAPS) 936/1226 variables, 290/293 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1226 variables, 675/968 constraints. Problems are: Problem set: 26 solved, 909 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1226 variables, 909/1877 constraints. Problems are: Problem set: 26 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1226/1226 variables, and 1877 constraints, problems are : Problem set: 26 solved, 909 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 290/290 constraints, ReadFeed: 675/675 constraints, PredecessorRefiner: 909/935 constraints, Known Traps: 0/0 constraints]
After SMT, in 63848ms problems are : Problem set: 26 solved, 909 unsolved
Search for dead transitions found 26 dead transitions in 63881ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 290/2385 places, 910/11934 transitions.
Reduce places removed 27 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 263 transition count 897
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 39 rules in 6 ms. Remains 263 /290 variables (removed 27) and now considering 896/910 (removed 14) transitions.
// Phase 1: matrix 896 rows 263 cols
[2024-06-01 05:11:52] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 05:11:52] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 05:11:52] [INFO ] Invariant cache hit.
[2024-06-01 05:11:52] [INFO ] State equation strengthened by 669 read => feed constraints.
[2024-06-01 05:11:53] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/2385 places, 896/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67646 ms. Remains : 263/2385 places, 896/11934 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 28 out of 262 places after structural reductions.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:11:54] [INFO ] Flatten gal took : 84 ms
[2024-06-01 05:11:54] [INFO ] Flatten gal took : 52 ms
[2024-06-01 05:11:54] [INFO ] Input system was already deterministic with 896 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (6324 resets) in 2630 ms. (15 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40003 steps (855 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1005 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (870 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
// Phase 1: matrix 896 rows 262 cols
[2024-06-01 05:11:55] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 05:11:55] [INFO ] State equation strengthened by 669 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 387/470 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 160/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 1158/1158 variables, and 424 constraints, problems are : Problem set: 3 solved, 0 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 262/262 constraints, ReadFeed: 160/669 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Computed a total of 53 stabilizing places and 324 stable transitions
Graph (complete) has 1424 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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)&&F((G(p1)||G(!p1))))))'
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 240 transition count 426
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 240 transition count 426
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 240 transition count 421
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 222 transition count 403
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 222 transition count 403
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 222 transition count 398
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 146 place count 166 transition count 342
Iterating global reduction 2 with 56 rules applied. Total rules applied 202 place count 166 transition count 342
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 278 place count 166 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 280 place count 164 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 164 transition count 240
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 163 transition count 239
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 163 transition count 239
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 288 place count 159 transition count 235
Iterating global reduction 3 with 4 rules applied. Total rules applied 292 place count 159 transition count 235
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 304 place count 159 transition count 223
Applied a total of 304 rules in 34 ms. Remains 159 /262 variables (removed 103) and now considering 223/896 (removed 673) transitions.
// Phase 1: matrix 223 rows 159 cols
[2024-06-01 05:11:56] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:11:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 05:11:56] [INFO ] Invariant cache hit.
[2024-06-01 05:11:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 05:11:56] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-01 05:11:56] [INFO ] Invariant cache hit.
[2024-06-01 05:11:56] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/382 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 83/244 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 05:12:00] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 11 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/245 constraints. Problems are: Problem set: 10 solved, 212 unsolved
[2024-06-01 05:12:03] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:12:03] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 2/247 constraints. Problems are: Problem set: 10 solved, 212 unsolved
[2024-06-01 05:12:03] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/248 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/248 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/248 constraints. Problems are: Problem set: 20 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 248 constraints, problems are : Problem set: 20 solved, 202 unsolved in 12391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 8/151 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 223/374 variables, 151/153 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 83/236 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 41/277 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/277 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 8/382 variables, 8/285 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 161/446 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 4/450 constraints. Problems are: Problem set: 20 solved, 202 unsolved
[2024-06-01 05:12:19] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:12:19] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-06-01 05:12:21] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 3/453 constraints. Problems are: Problem set: 22 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/453 constraints. Problems are: Problem set: 22 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/453 constraints. Problems are: Problem set: 22 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 453 constraints, problems are : Problem set: 22 solved, 200 unsolved in 25019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 202/222 constraints, Known Traps: 7/7 constraints]
After SMT, in 37786ms problems are : Problem set: 22 solved, 200 unsolved
Search for dead transitions found 22 dead transitions in 37789ms
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 : 159/262 places, 201/896 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 141 transition count 195
Applied a total of 24 rules in 3 ms. Remains 141 /159 variables (removed 18) and now considering 195/201 (removed 6) transitions.
// Phase 1: matrix 195 rows 141 cols
[2024-06-01 05:12:34] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:12:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:12:34] [INFO ] Invariant cache hit.
[2024-06-01 05:12:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-01 05:12:34] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/262 places, 195/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38895 ms. Remains : 141/262 places, 195/896 transitions.
Stuttering acceptance computed with spot in 507 ms :[(NOT p0), (NOT p0), true, false]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 finished in 39488 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 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 421
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 421
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 239 transition count 416
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 220 transition count 397
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 220 transition count 397
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 220 transition count 392
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 152 place count 162 transition count 334
Iterating global reduction 2 with 58 rules applied. Total rules applied 210 place count 162 transition count 334
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 284 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 286 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 288 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 291 place count 159 transition count 232
Applied a total of 291 rules in 20 ms. Remains 159 /262 variables (removed 103) and now considering 232/896 (removed 664) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-06-01 05:12:35] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:12:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 05:12:35] [INFO ] Invariant cache hit.
[2024-06-01 05:12:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:12:35] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 05:12:35] [INFO ] Invariant cache hit.
[2024-06-01 05:12:35] [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 6710 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-06-01 05:12:47] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 05:12:47] [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-06-01 05:12:47] [INFO ] Deduced a trap composed of 61 places in 51 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
[2024-06-01 05:12:49] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 4 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-06-01 05:12:49] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:12:49] [INFO ] Deduced a trap composed of 58 places in 49 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 17945 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 25018ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 25021ms
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 : 159/262 places, 210/896 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 141 transition count 204
Applied a total of 24 rules in 6 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-06-01 05:13:00] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:13:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 05:13:01] [INFO ] Invariant cache hit.
[2024-06-01 05:13:01] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 05:13:01] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/262 places, 204/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25842 ms. Remains : 141/262 places, 204/896 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-02
Entered a terminal (fully accepting) state of product in 98 steps with 17 reset in 6 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 finished in 25969 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 2 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 421
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 421
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 239 transition count 416
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 220 transition count 397
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 220 transition count 397
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 220 transition count 392
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 152 place count 162 transition count 334
Iterating global reduction 2 with 58 rules applied. Total rules applied 210 place count 162 transition count 334
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 280 place count 162 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 282 place count 160 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 284 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 159 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 159 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 159 transition count 236
Applied a total of 287 rules in 61 ms. Remains 159 /262 variables (removed 103) and now considering 236/896 (removed 660) transitions.
// Phase 1: matrix 236 rows 159 cols
[2024-06-01 05:13:01] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:13:01] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 05:13:01] [INFO ] Invariant cache hit.
[2024-06-01 05:13:01] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-01 05:13:01] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-01 05:13:01] [INFO ] Redundant transitions in 15 ms returned []
Running 235 sub problems to find dead transitions.
[2024-06-01 05:13:01] [INFO ] Invariant cache hit.
[2024-06-01 05:13:02] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 256 constraints, problems are : Problem set: 0 solved, 235 unsolved in 6862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 235/491 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 05:13:13] [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-06-01 05:13:14] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
[2024-06-01 05:13:16] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
[2024-06-01 05:13:16] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
[2024-06-01 05:13:16] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:13:16] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 6/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 497 constraints, problems are : Problem set: 22 solved, 213 unsolved in 19686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 6/6 constraints]
After SMT, in 26910ms problems are : Problem set: 22 solved, 213 unsolved
Search for dead transitions found 22 dead transitions in 26913ms
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/262 places, 214/896 transitions.
Graph (complete) has 521 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 208
Applied a total of 7 rules in 23 ms. Remains 141 /159 variables (removed 18) and now considering 208/214 (removed 6) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-06-01 05:13:28] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:13:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 05:13:29] [INFO ] Invariant cache hit.
[2024-06-01 05:13:29] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:13:29] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/262 places, 208/896 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27922 ms. Remains : 141/262 places, 208/896 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-03 finished in 28035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 238 transition count 390
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 238 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 238 transition count 386
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 218 transition count 366
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 218 transition count 366
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 218 transition count 362
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 158 place count 156 transition count 300
Iterating global reduction 2 with 62 rules applied. Total rules applied 220 place count 156 transition count 300
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 282 place count 156 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 155 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 155 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 154 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 154 transition count 224
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 290 place count 150 transition count 220
Iterating global reduction 3 with 4 rules applied. Total rules applied 294 place count 150 transition count 220
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 306 place count 150 transition count 208
Applied a total of 306 rules in 17 ms. Remains 150 /262 variables (removed 112) and now considering 208/896 (removed 688) transitions.
// Phase 1: matrix 208 rows 150 cols
[2024-06-01 05:13:29] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:13:29] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 05:13:29] [INFO ] Invariant cache hit.
[2024-06-01 05:13:29] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 05:13:29] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-06-01 05:13:29] [INFO ] Invariant cache hit.
[2024-06-01 05:13:29] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/358 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 76/228 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 05:13:35] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/358 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-01 05:13:36] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 3/232 constraints. Problems are: Problem set: 20 solved, 187 unsolved
[2024-06-01 05:13:38] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/233 constraints. Problems are: Problem set: 20 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/233 constraints. Problems are: Problem set: 20 solved, 187 unsolved
[2024-06-01 05:13:42] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/358 variables, 1/234 constraints. Problems are: Problem set: 20 solved, 187 unsolved
[2024-06-01 05:13:43] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 1/235 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/235 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/235 constraints. Problems are: Problem set: 21 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 235 constraints, problems are : Problem set: 21 solved, 186 unsolved in 18973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 21 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 8/141 variables, 1/2 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 208/349 variables, 141/144 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 76/220 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 40/260 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/260 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 10 (OVERLAPS) 9/358 variables, 9/269 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 146/415 constraints. Problems are: Problem set: 21 solved, 186 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 6/421 constraints. Problems are: Problem set: 21 solved, 186 unsolved
[2024-06-01 05:14:00] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 1/422 constraints. Problems are: Problem set: 22 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/422 constraints. Problems are: Problem set: 22 solved, 185 unsolved
[2024-06-01 05:14:06] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/358 variables, 1/423 constraints. Problems are: Problem set: 22 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/423 constraints. Problems are: Problem set: 22 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/358 variables, 0/423 constraints. Problems are: Problem set: 22 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 423 constraints, problems are : Problem set: 22 solved, 185 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 186/207 constraints, Known Traps: 9/9 constraints]
After SMT, in 49244ms problems are : Problem set: 22 solved, 185 unsolved
Search for dead transitions found 22 dead transitions in 49247ms
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 : 150/262 places, 186/896 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 132 transition count 180
Applied a total of 24 rules in 3 ms. Remains 132 /150 variables (removed 18) and now considering 180/186 (removed 6) transitions.
// Phase 1: matrix 180 rows 132 cols
[2024-06-01 05:14:19] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 05:14:19] [INFO ] Invariant cache hit.
[2024-06-01 05:14:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 132/262 places, 180/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49944 ms. Remains : 132/262 places, 180/896 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 finished in 50057 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(F(p0))||G((p1 U p2))))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 241 transition count 427
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 241 transition count 427
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 241 transition count 424
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 223 transition count 406
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 223 transition count 406
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 223 transition count 402
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 143 place count 165 transition count 344
Iterating global reduction 2 with 58 rules applied. Total rules applied 201 place count 165 transition count 344
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 279 place count 165 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 164 transition count 253
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 164 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 163 transition count 252
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 163 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 163 transition count 251
Applied a total of 284 rules in 19 ms. Remains 163 /262 variables (removed 99) and now considering 251/896 (removed 645) transitions.
// Phase 1: matrix 251 rows 163 cols
[2024-06-01 05:14:19] [INFO ] Computed 2 invariants in 8 ms
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 05:14:19] [INFO ] Invariant cache hit.
[2024-06-01 05:14:19] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 05:14:19] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2024-06-01 05:14:19] [INFO ] Invariant cache hit.
[2024-06-01 05:14:19] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/414 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 107/272 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 272 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7719 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/414 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 107/272 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 250/522 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-06-01 05:14:33] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-01 05:14:33] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
[2024-06-01 05:14:33] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
[2024-06-01 05:14:35] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
[2024-06-01 05:14:36] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:14:36] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 6/528 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/528 constraints. Problems are: Problem set: 22 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/528 constraints. Problems are: Problem set: 22 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 528 constraints, problems are : Problem set: 22 solved, 228 unsolved in 22428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 6/6 constraints]
After SMT, in 30540ms problems are : Problem set: 22 solved, 228 unsolved
Search for dead transitions found 22 dead transitions in 30543ms
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 : 163/262 places, 229/896 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 145 transition count 223
Applied a total of 24 rules in 2 ms. Remains 145 /163 variables (removed 18) and now considering 223/229 (removed 6) transitions.
// Phase 1: matrix 223 rows 145 cols
[2024-06-01 05:14:50] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:14:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 05:14:50] [INFO ] Invariant cache hit.
[2024-06-01 05:14:50] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-01 05:14:50] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/262 places, 223/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31360 ms. Remains : 145/262 places, 223/896 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 finished in 31656 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 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 421
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 421
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 239 transition count 416
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 220 transition count 397
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 220 transition count 397
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 220 transition count 392
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 152 place count 162 transition count 334
Iterating global reduction 2 with 58 rules applied. Total rules applied 210 place count 162 transition count 334
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 284 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 286 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 288 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 291 place count 159 transition count 232
Applied a total of 291 rules in 19 ms. Remains 159 /262 variables (removed 103) and now considering 232/896 (removed 664) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-06-01 05:14:51] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:14:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 05:14:51] [INFO ] Invariant cache hit.
[2024-06-01 05:14:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:14:51] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-01 05:14:51] [INFO ] Invariant cache hit.
[2024-06-01 05:14:51] [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 6459 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-06-01 05:15:02] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 6 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 05:15:02] [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-06-01 05:15:02] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 0 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
[2024-06-01 05:15:04] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-06-01 05:15:04] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:15:04] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 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 17781 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 24603ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 24607ms
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 : 159/262 places, 210/896 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 141 transition count 204
Applied a total of 24 rules in 2 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-06-01 05:15:16] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 05:15:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 05:15:16] [INFO ] Invariant cache hit.
[2024-06-01 05:15:16] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 05:15:16] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/262 places, 204/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25435 ms. Remains : 141/262 places, 204/896 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 finished in 25518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p2 U (p3||G(!p2)))||p1)))&&p0)))'
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 241 transition count 457
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 241 transition count 457
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 241 transition count 452
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 223 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 223 transition count 434
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 89 place count 223 transition count 428
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 143 place count 169 transition count 374
Iterating global reduction 2 with 54 rules applied. Total rules applied 197 place count 169 transition count 374
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 86 rules applied. Total rules applied 283 place count 169 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 168 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 168 transition count 275
Applied a total of 285 rules in 32 ms. Remains 168 /262 variables (removed 94) and now considering 275/896 (removed 621) transitions.
// Phase 1: matrix 275 rows 168 cols
[2024-06-01 05:15:16] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:15:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 05:15:16] [INFO ] Invariant cache hit.
[2024-06-01 05:15:16] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-06-01 05:15:17] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-06-01 05:15:17] [INFO ] Redundant transitions in 13 ms returned []
Running 274 sub problems to find dead transitions.
[2024-06-01 05:15:17] [INFO ] Invariant cache hit.
[2024-06-01 05:15:17] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/443 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 127/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 274 unsolved in 8874 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/443 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 127/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 274/571 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-01 05:15:33] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-06-01 05:15:33] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-06-01 05:15:33] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
[2024-06-01 05:15:36] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-06-01 05:15:36] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-06-01 05:15:36] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 6/577 constraints. Problems are: Problem set: 22 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/577 constraints. Problems are: Problem set: 22 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/443 variables, 0/577 constraints. Problems are: Problem set: 22 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 577 constraints, problems are : Problem set: 22 solved, 252 unsolved in 27764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 6/6 constraints]
After SMT, in 37093ms problems are : Problem set: 22 solved, 252 unsolved
Search for dead transitions found 22 dead transitions in 37095ms
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/262 places, 253/896 transitions.
Graph (complete) has 576 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 247
Applied a total of 7 rules in 18 ms. Remains 150 /168 variables (removed 18) and now considering 247/253 (removed 6) transitions.
// Phase 1: matrix 247 rows 150 cols
[2024-06-01 05:15:54] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:15:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 05:15:54] [INFO ] Invariant cache hit.
[2024-06-01 05:15:54] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-06-01 05:15:54] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/262 places, 247/896 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38177 ms. Remains : 150/262 places, 247/896 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p3) (NOT p1) p2), (AND (NOT p3) (NOT p1) p2), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-09
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 finished in 38386 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((X(G((p1 U p2)))||p0)))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 241 transition count 427
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 241 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 241 transition count 422
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 224 transition count 405
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 224 transition count 405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 224 transition count 402
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 142 place count 166 transition count 344
Iterating global reduction 2 with 58 rules applied. Total rules applied 200 place count 166 transition count 344
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 274 place count 166 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 275 place count 165 transition count 257
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 165 transition count 257
Applied a total of 276 rules in 19 ms. Remains 165 /262 variables (removed 97) and now considering 257/896 (removed 639) transitions.
// Phase 1: matrix 257 rows 165 cols
[2024-06-01 05:15:55] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:15:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 05:15:55] [INFO ] Invariant cache hit.
[2024-06-01 05:15:55] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:15:55] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 05:15:55] [INFO ] Invariant cache hit.
[2024-06-01 05:15:55] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/422 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 111/278 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 278 constraints, problems are : Problem set: 0 solved, 256 unsolved in 7968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/422 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 111/278 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 256/534 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-01 05:16:09] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-06-01 05:16:09] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 05:16:09] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:16:10] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
[2024-06-01 05:16:12] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:16:12] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 6/540 constraints. Problems are: Problem set: 22 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/540 constraints. Problems are: Problem set: 22 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/540 constraints. Problems are: Problem set: 22 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 540 constraints, problems are : Problem set: 22 solved, 234 unsolved in 23892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 6/6 constraints]
After SMT, in 32313ms problems are : Problem set: 22 solved, 234 unsolved
Search for dead transitions found 22 dead transitions in 32316ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 165/262 places, 235/896 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 147 transition count 229
Applied a total of 24 rules in 2 ms. Remains 147 /165 variables (removed 18) and now considering 229/235 (removed 6) transitions.
// Phase 1: matrix 229 rows 147 cols
[2024-06-01 05:16:27] [INFO ] Computed 2 invariants in 17 ms
[2024-06-01 05:16:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 05:16:27] [INFO ] Invariant cache hit.
[2024-06-01 05:16:28] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 05:16:28] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/262 places, 229/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33305 ms. Remains : 147/262 places, 229/896 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-10
Entered a terminal (fully accepting) state of product in 124 steps with 19 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 finished in 33528 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))))'
Support contains 2 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 425
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 239 transition count 420
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 220 transition count 401
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 220 transition count 401
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 220 transition count 396
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 152 place count 162 transition count 338
Iterating global reduction 2 with 58 rules applied. Total rules applied 210 place count 162 transition count 338
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 284 place count 162 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 286 place count 160 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 288 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 159 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 159 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 291 place count 159 transition count 236
Applied a total of 291 rules in 20 ms. Remains 159 /262 variables (removed 103) and now considering 236/896 (removed 660) transitions.
// Phase 1: matrix 236 rows 159 cols
[2024-06-01 05:16:28] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:16:29] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-01 05:16:29] [INFO ] Invariant cache hit.
[2024-06-01 05:16:29] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-01 05:16:29] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-06-01 05:16:29] [INFO ] Invariant cache hit.
[2024-06-01 05:16:29] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 05:16:33] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-01 05:16:33] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-06-01 05:16:33] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:16:33] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 6 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 4/260 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/260 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/260 constraints. Problems are: Problem set: 21 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 260 constraints, problems are : Problem set: 21 solved, 214 unsolved in 9139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 21 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 8/150 variables, 1/2 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 236/386 variables, 150/153 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 95/248 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 40/288 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/288 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 9/395 variables, 9/297 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 174/471 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 3/474 constraints. Problems are: Problem set: 21 solved, 214 unsolved
[2024-06-01 05:16:50] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 1/475 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/475 constraints. Problems are: Problem set: 22 solved, 213 unsolved
[2024-06-01 05:17:01] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:17:01] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:17:04] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/395 variables, 3/478 constraints. Problems are: Problem set: 22 solved, 213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 2)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 2)
(s127 0)
(s128 1)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 478 constraints, problems are : Problem set: 22 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 214/235 constraints, Known Traps: 8/8 constraints]
After SMT, in 39524ms problems are : Problem set: 22 solved, 213 unsolved
Search for dead transitions found 22 dead transitions in 39526ms
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 : 159/262 places, 214/896 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 141 transition count 208
Applied a total of 24 rules in 5 ms. Remains 141 /159 variables (removed 18) and now considering 208/214 (removed 6) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-06-01 05:17:09] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:17:09] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 05:17:09] [INFO ] Invariant cache hit.
[2024-06-01 05:17:09] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 05:17:09] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/262 places, 208/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40932 ms. Remains : 141/262 places, 208/896 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-11
Entered a terminal (fully accepting) state of product in 641 steps with 121 reset in 4 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-11 finished in 41081 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(X(G(p0))) U p1))'
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 240 transition count 422
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 240 transition count 422
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 240 transition count 417
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 222 transition count 399
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 222 transition count 399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 89 place count 222 transition count 395
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 147 place count 164 transition count 337
Iterating global reduction 2 with 58 rules applied. Total rules applied 205 place count 164 transition count 337
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 279 place count 164 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 163 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 163 transition count 250
Applied a total of 281 rules in 12 ms. Remains 163 /262 variables (removed 99) and now considering 250/896 (removed 646) transitions.
// Phase 1: matrix 250 rows 163 cols
[2024-06-01 05:17:09] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 05:17:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 05:17:09] [INFO ] Invariant cache hit.
[2024-06-01 05:17:09] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 05:17:10] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-06-01 05:17:10] [INFO ] Invariant cache hit.
[2024-06-01 05:17:10] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/413 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 106/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 271 constraints, problems are : Problem set: 0 solved, 249 unsolved in 7888 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/413 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 106/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 249/520 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-01 05:17:22] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:17:23] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-06-01 05:17:23] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
[2024-06-01 05:17:26] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-06-01 05:17:26] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:17:26] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 6/526 constraints. Problems are: Problem set: 22 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/526 constraints. Problems are: Problem set: 22 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/526 constraints. Problems are: Problem set: 22 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 526 constraints, problems are : Problem set: 22 solved, 227 unsolved in 23146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 6/6 constraints]
After SMT, in 31414ms problems are : Problem set: 22 solved, 227 unsolved
Search for dead transitions found 22 dead transitions in 31419ms
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 : 163/262 places, 228/896 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 145 transition count 222
Applied a total of 24 rules in 4 ms. Remains 145 /163 variables (removed 18) and now considering 222/228 (removed 6) transitions.
// Phase 1: matrix 222 rows 145 cols
[2024-06-01 05:17:41] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:17:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 05:17:41] [INFO ] Invariant cache hit.
[2024-06-01 05:17:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:17:41] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/262 places, 222/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32271 ms. Remains : 145/262 places, 222/896 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 finished in 32413 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 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 896/896 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 391
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 391
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 239 transition count 388
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 69 place count 219 transition count 368
Iterating global reduction 1 with 20 rules applied. Total rules applied 89 place count 219 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 93 place count 219 transition count 364
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 155 place count 157 transition count 302
Iterating global reduction 2 with 62 rules applied. Total rules applied 217 place count 157 transition count 302
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 279 place count 157 transition count 240
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 281 place count 155 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 283 place count 155 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 154 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 154 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 154 transition count 212
Applied a total of 286 rules in 17 ms. Remains 154 /262 variables (removed 108) and now considering 212/896 (removed 684) transitions.
// Phase 1: matrix 212 rows 154 cols
[2024-06-01 05:17:42] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:17:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:17:42] [INFO ] Invariant cache hit.
[2024-06-01 05:17:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 05:17:42] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-06-01 05:17:42] [INFO ] Invariant cache hit.
[2024-06-01 05:17:42] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 231 constraints, problems are : Problem set: 0 solved, 211 unsolved in 5997 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 211/442 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-01 05:17:53] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:17:53] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
[2024-06-01 05:17:54] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 5/447 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 22 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/447 constraints. Problems are: Problem set: 22 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 22 solved, 189 unsolved in 17138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 5/5 constraints]
After SMT, in 23455ms problems are : Problem set: 22 solved, 189 unsolved
Search for dead transitions found 22 dead transitions in 23458ms
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 : 154/262 places, 190/896 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 136 transition count 184
Applied a total of 24 rules in 4 ms. Remains 136 /154 variables (removed 18) and now considering 184/190 (removed 6) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-06-01 05:18:05] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:18:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 05:18:06] [INFO ] Invariant cache hit.
[2024-06-01 05:18:06] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-01 05:18:06] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/262 places, 184/896 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24169 ms. Remains : 136/262 places, 184/896 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-14 finished in 24285 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((G(!p0)||(F(G(p1)) U p2)))))'
Support contains 3 out of 262 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 : 262/262 places, 896/896 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 241 transition count 487
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 241 transition count 487
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 241 transition count 480
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 224 transition count 463
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 224 transition count 463
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 90 place count 224 transition count 456
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 140 place count 174 transition count 406
Iterating global reduction 2 with 50 rules applied. Total rules applied 190 place count 174 transition count 406
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 280 place count 174 transition count 316
Applied a total of 280 rules in 29 ms. Remains 174 /262 variables (removed 88) and now considering 316/896 (removed 580) transitions.
// Phase 1: matrix 316 rows 174 cols
[2024-06-01 05:18:06] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:18:06] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 05:18:06] [INFO ] Invariant cache hit.
[2024-06-01 05:18:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 05:18:07] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-06-01 05:18:07] [INFO ] Redundant transitions in 6 ms returned []
Running 315 sub problems to find dead transitions.
[2024-06-01 05:18:07] [INFO ] Invariant cache hit.
[2024-06-01 05:18:07] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 340 constraints, problems are : Problem set: 0 solved, 315 unsolved in 12223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 315/655 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-01 05:18:28] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 05:18:28] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-06-01 05:18:28] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:18:28] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
[2024-06-01 05:18:31] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:18:31] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 6/661 constraints. Problems are: Problem set: 22 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/661 constraints. Problems are: Problem set: 22 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/661 constraints. Problems are: Problem set: 22 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 661 constraints, problems are : Problem set: 22 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 6/6 constraints]
After SMT, in 42787ms problems are : Problem set: 22 solved, 293 unsolved
Search for dead transitions found 22 dead transitions in 42790ms
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 : 174/262 places, 294/896 transitions.
Graph (complete) has 626 edges and 174 vertex of which 156 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 156 transition count 288
Applied a total of 7 rules in 9 ms. Remains 156 /174 variables (removed 18) and now considering 288/294 (removed 6) transitions.
// Phase 1: matrix 288 rows 156 cols
[2024-06-01 05:18:49] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:18:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 05:18:49] [INFO ] Invariant cache hit.
[2024-06-01 05:18:50] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 05:18:50] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 156/262 places, 288/896 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44098 ms. Remains : 156/262 places, 288/896 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-15
Product exploration explored 100000 steps with 17811 reset in 285 ms.
Product exploration explored 100000 steps with 18012 reset in 274 ms.
Computed a total of 13 stabilizing places and 79 stable transitions
Graph (complete) has 606 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 4703 steps (841 resets) in 92 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 3 out of 156 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 : 156/156 places, 288/288 transitions.
Applied a total of 0 rules in 14 ms. Remains 156 /156 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-06-01 05:18:51] [INFO ] Invariant cache hit.
[2024-06-01 05:18:52] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 05:18:52] [INFO ] Invariant cache hit.
[2024-06-01 05:18:52] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 05:18:52] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2024-06-01 05:18:52] [INFO ] Redundant transitions in 5 ms returned []
Running 287 sub problems to find dead transitions.
[2024-06-01 05:18:52] [INFO ] Invariant cache hit.
[2024-06-01 05:18:52] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/444 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 160/318 constraints. Problems are: Problem set: 0 solved, 287 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 318 constraints, problems are : Problem set: 0 solved, 287 unsolved in 9756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/444 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 160/318 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 287/605 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 605 constraints, problems are : Problem set: 0 solved, 287 unsolved in 22203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints]
After SMT, in 32397ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 32400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33153 ms. Remains : 156/156 places, 288/288 transitions.
Computed a total of 13 stabilizing places and 79 stable transitions
Graph (complete) has 606 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 13 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 1457 steps (260 resets) in 14 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 18082 reset in 211 ms.
Product exploration explored 100000 steps with 17886 reset in 216 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 288/288 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 154 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 154 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 150 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 150 transition count 266
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 150 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 149 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 149 transition count 245
Applied a total of 22 rules in 12 ms. Remains 149 /156 variables (removed 7) and now considering 245/288 (removed 43) transitions.
// Phase 1: matrix 245 rows 149 cols
[2024-06-01 05:19:26] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:19:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 05:19:26] [INFO ] Invariant cache hit.
[2024-06-01 05:19:26] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 05:19:26] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-01 05:19:26] [INFO ] Redundant transitions in 0 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 05:19:26] [INFO ] Invariant cache hit.
[2024-06-01 05:19:26] [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 8393 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 16717 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 25419ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 25423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 149/156 places, 245/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25928 ms. Remains : 149/156 places, 245/288 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-15 finished in 105788 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((G(!p0)||(F(G(p1)) U p2)))))'
[2024-06-01 05:19:52] [INFO ] Flatten gal took : 38 ms
[2024-06-01 05:19:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 05:19:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 262 places, 896 transitions and 3552 arcs took 13 ms.
Total runtime 547231 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m080-LTLFireability-15

BK_STOP 1717219306105

--------------------
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
mcc2024
ltl formula name RingSingleMessageInMbox-PT-d1m080-LTLFireability-15
ltl formula formula --ltl=/tmp/1426/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 262 places, 896 transitions and 3552 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.010 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1426/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1426/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1426/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1426/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 263 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 263, there are 904 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~143 levels ~10000 states ~30064 transitions
pnml2lts-mc( 3/ 4): ~143 levels ~20000 states ~59672 transitions
pnml2lts-mc( 0/ 4): ~396 levels ~40000 states ~137352 transitions
pnml2lts-mc( 0/ 4): ~396 levels ~80000 states ~255476 transitions
pnml2lts-mc( 0/ 4): ~396 levels ~160000 states ~490820 transitions
pnml2lts-mc( 0/ 4): ~4999 levels ~320000 states ~1080000 transitions
pnml2lts-mc( 0/ 4): ~16421 levels ~640000 states ~2315588 transitions
pnml2lts-mc( 0/ 4): ~35620 levels ~1280000 states ~4752236 transitions
pnml2lts-mc( 2/ 4): ~399 levels ~2560000 states ~5533908 transitions
pnml2lts-mc( 2/ 4): ~399 levels ~5120000 states ~11226948 transitions
pnml2lts-mc( 2/ 4): ~399 levels ~10240000 states ~22828048 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9597558
pnml2lts-mc( 0/ 4): unique states count: 10707548
pnml2lts-mc( 0/ 4): unique transitions count: 31413244
pnml2lts-mc( 0/ 4): - self-loop count: 13809792
pnml2lts-mc( 0/ 4): - claim dead count: 1674709
pnml2lts-mc( 0/ 4): - claim found count: 1730720
pnml2lts-mc( 0/ 4): - claim success count: 10707560
pnml2lts-mc( 0/ 4): - cum. max stack depth: 588772
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10707560 states 31413335 transitions, fanout: 2.934
pnml2lts-mc( 0/ 4): Total exploration time 112.560 sec (112.480 sec minimum, 112.512 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95128, Transitions per second: 279081
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 171.1MB, 12.8 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 41.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 908 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 171.1MB (~256.0MB paged-in)

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-d1m080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d1m080, 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 r524-tall-171679079600092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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