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.r179-tall-171640601100243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FunctionPointer-PT-b016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 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 FunctionPointer-PT-b016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716432262131

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:44:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:44:23] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-23 02:44:23] [INFO ] Transformed 306 places.
[2024-05-23 02:44:23] [INFO ] Transformed 840 transitions.
[2024-05-23 02:44:23] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 14 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 34 place count 188 transition count 494
Iterating global reduction 1 with 25 rules applied. Total rules applied 59 place count 188 transition count 494
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 89 place count 188 transition count 464
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 99 place count 178 transition count 444
Iterating global reduction 2 with 10 rules applied. Total rules applied 109 place count 178 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 178 transition count 440
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 175 transition count 434
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 175 transition count 434
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 172 transition count 422
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 172 transition count 422
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 128 place count 169 transition count 416
Iterating global reduction 3 with 3 rules applied. Total rules applied 131 place count 169 transition count 416
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 167 transition count 408
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 167 transition count 408
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 165 transition count 400
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 165 transition count 400
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 163 transition count 396
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 163 transition count 396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 161 transition count 392
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 161 transition count 392
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 159 transition count 388
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 159 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 157 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 157 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 156 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 156 transition count 382
Applied a total of 157 rules in 110 ms. Remains 156 /222 variables (removed 66) and now considering 382/648 (removed 266) transitions.
[2024-05-23 02:44:23] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
// Phase 1: matrix 265 rows 156 cols
[2024-05-23 02:44:23] [INFO ] Computed 2 invariants in 22 ms
[2024-05-23 02:44:24] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 02:44:24] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
[2024-05-23 02:44:24] [INFO ] Invariant cache hit.
[2024-05-23 02:44:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-23 02:44:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-05-23 02:44:24] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
[2024-05-23 02:44:24] [INFO ] Invariant cache hit.
[2024-05-23 02:44:24] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 265/420 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 58/215 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 380 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/421 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 8 (OVERLAPS) 0/421 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 216 constraints, problems are : Problem set: 0 solved, 380 unsolved in 14757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 265/420 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 58/215 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 32/247 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (OVERLAPS) 1/421 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 348/596 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 10 (OVERLAPS) 0/421 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 596 constraints, problems are : Problem set: 0 solved, 380 unsolved in 20646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints]
After SMT, in 36019ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 36035ms
Starting structural reductions in LTL mode, iteration 1 : 156/222 places, 382/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36734 ms. Remains : 156/222 places, 382/648 transitions.
Support contains 20 out of 156 places after structural reductions.
[2024-05-23 02:45:00] [INFO ] Flatten gal took : 52 ms
[2024-05-23 02:45:00] [INFO ] Flatten gal took : 24 ms
[2024-05-23 02:45:00] [INFO ] Input system was already deterministic with 382 transitions.
RANDOM walk for 40015 steps (29 resets) in 1081 ms. (36 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40003 steps (20 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2024-05-23 02:45:01] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
[2024-05-23 02:45:01] [INFO ] Invariant cache hit.
[2024-05-23 02:45:01] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/81 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 134/215 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 8 (OVERLAPS) 174/389 variables, 88/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 47/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/395 variables, 1/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/416 variables, 20/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/421 variables, 3/216 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/421 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 216 constraints, problems are : Problem set: 1 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/141 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 221/362 variables, 114/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 58/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/368 variables, 1/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 45/413 variables, 33/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/419 variables, 2/215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/421 variables, 2/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/421 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 217 constraints, problems are : Problem set: 1 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 410ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 382/382 transitions.
Graph (complete) has 625 edges and 156 vertex of which 131 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 131 transition count 334
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 123 transition count 318
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 123 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 123 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 118 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 118 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 113 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 113 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 109 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 109 transition count 278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 105 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 105 transition count 268
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 101 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 101 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 97 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 97 transition count 242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 93 transition count 234
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 93 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 90 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 90 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 87 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 87 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 84 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 84 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 82 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 82 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 82 transition count 208
Applied a total of 153 rules in 80 ms. Remains 82 /156 variables (removed 74) and now considering 208/382 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 82/156 places, 208/382 transitions.
RANDOM walk for 36975 steps (8 resets) in 159 ms. (231 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 831 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Graph (complete) has 831 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 148 transition count 368
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 148 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 148 transition count 366
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 144 transition count 356
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 144 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 140 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 140 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 136 transition count 332
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 136 transition count 332
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 132 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 132 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 128 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 128 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 124 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 124 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 117 transition count 282
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 114 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 111 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 108 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 108 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 108 transition count 260
Applied a total of 101 rules in 69 ms. Remains 108 /156 variables (removed 48) and now considering 260/382 (removed 122) transitions.
[2024-05-23 02:45:02] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2024-05-23 02:45:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:45:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 02:45:02] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:02] [INFO ] Invariant cache hit.
[2024-05-23 02:45:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 02:45:02] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-23 02:45:02] [INFO ] Redundant transitions in 24 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 02:45:02] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:02] [INFO ] Invariant cache hit.
[2024-05-23 02:45:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6822 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7729 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14761ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14763ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/156 places, 260/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15085 ms. Remains : 108/156 places, 260/382 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-00
Product exploration explored 100000 steps with 576 reset in 360 ms.
Product exploration explored 100000 steps with 618 reset in 293 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 22501 steps (37 resets) in 56 ms. (394 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 02:45:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:18] [INFO ] Invariant cache hit.
[2024-05-23 02:45:18] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-23 02:45:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:18] [INFO ] Invariant cache hit.
[2024-05-23 02:45:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 02:45:18] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-23 02:45:18] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 02:45:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:18] [INFO ] Invariant cache hit.
[2024-05-23 02:45:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14515ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14876 ms. Remains : 108/108 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 23679 steps (33 resets) in 64 ms. (364 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 587 reset in 235 ms.
Product exploration explored 100000 steps with 575 reset in 275 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-23 02:45:34] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:34] [INFO ] Invariant cache hit.
[2024-05-23 02:45:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-23 02:45:34] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:34] [INFO ] Invariant cache hit.
[2024-05-23 02:45:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 02:45:34] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-23 02:45:34] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 02:45:34] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-23 02:45:34] [INFO ] Invariant cache hit.
[2024-05-23 02:45:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14744ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15017 ms. Remains : 108/108 places, 260/260 transitions.
Treatment of property FunctionPointer-PT-b016-LTLCardinality-00 finished in 47126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 148 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 148 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 143 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 143 transition count 354
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 139 transition count 342
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 139 transition count 342
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 131 transition count 320
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 131 transition count 320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 127 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 123 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 119 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 119 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 116 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 113 transition count 274
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 110 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 108 transition count 264
Applied a total of 97 rules in 19 ms. Remains 108 /156 variables (removed 48) and now considering 264/382 (removed 118) transitions.
[2024-05-23 02:45:49] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 108 cols
[2024-05-23 02:45:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:45:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:45:49] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:45:49] [INFO ] Invariant cache hit.
[2024-05-23 02:45:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 02:45:49] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-23 02:45:49] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:45:49] [INFO ] Invariant cache hit.
[2024-05-23 02:45:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/289 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 152 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/289 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 262/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 414 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 14906ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14909ms
Starting structural reductions in LTL mode, iteration 1 : 108/156 places, 264/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15276 ms. Remains : 108/156 places, 264/382 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b016-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b016-LTLCardinality-03 finished in 15921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Graph (complete) has 831 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 147 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 147 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 142 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 137 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 137 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 132 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 132 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 127 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 127 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 122 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 117 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 112 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 112 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 108 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 104 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 109 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 113 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 97 transition count 234
Applied a total of 121 rules in 45 ms. Remains 97 /156 variables (removed 59) and now considering 234/382 (removed 148) transitions.
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-23 02:46:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:46:05] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:46:05] [INFO ] Invariant cache hit.
[2024-05-23 02:46:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:46:05] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-23 02:46:05] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 02:46:05] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:46:05] [INFO ] Invariant cache hit.
[2024-05-23 02:46:05] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 12293ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12296ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/156 places, 234/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12541 ms. Remains : 97/156 places, 234/382 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-07
Stuttering criterion allowed to conclude after 103 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-07 finished in 12586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Graph (complete) has 831 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 147 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 147 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 142 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 137 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 137 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 132 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 132 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 127 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 127 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 122 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 117 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 112 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 112 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 108 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 104 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 109 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 113 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 98 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 98 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 98 transition count 236
Applied a total of 119 rules in 39 ms. Remains 98 /156 variables (removed 58) and now considering 236/382 (removed 146) transitions.
[2024-05-23 02:46:17] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-23 02:46:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:46:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:46:17] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2024-05-23 02:46:17] [INFO ] Invariant cache hit.
[2024-05-23 02:46:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 02:46:17] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-23 02:46:17] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-23 02:46:17] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2024-05-23 02:46:17] [INFO ] Invariant cache hit.
[2024-05-23 02:46:17] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 139 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5754 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 234/373 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 373 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12265ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/156 places, 236/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12528 ms. Remains : 98/156 places, 236/382 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-08
Stuttering criterion allowed to conclude after 591 steps with 1 reset in 4 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-08 finished in 12579 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 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 147 transition count 366
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 147 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 142 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 137 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 137 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 132 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 132 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 127 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 127 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 122 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 117 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 112 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 112 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 108 transition count 258
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 104 transition count 250
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 100 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 97 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 97 transition count 236
Applied a total of 119 rules in 21 ms. Remains 97 /156 variables (removed 59) and now considering 236/382 (removed 146) transitions.
[2024-05-23 02:46:30] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-23 02:46:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:46:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-23 02:46:30] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:46:30] [INFO ] Invariant cache hit.
[2024-05-23 02:46:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:46:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-23 02:46:30] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:46:30] [INFO ] Invariant cache hit.
[2024-05-23 02:46:30] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12149ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12152ms
Starting structural reductions in LTL mode, iteration 1 : 97/156 places, 236/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12412 ms. Remains : 97/156 places, 236/382 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-09
Stuttering criterion allowed to conclude after 296 steps with 1 reset in 4 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-09 finished in 12523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X((p1&&X(X(G(!p0)))))) U p2)))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 382
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 149 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 149 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 145 transition count 362
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 145 transition count 362
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 142 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 142 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 139 transition count 344
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 139 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 136 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 136 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 133 transition count 324
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 133 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 130 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 127 transition count 308
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 127 transition count 308
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 124 transition count 302
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 124 transition count 302
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 121 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 121 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 118 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 118 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 116 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 116 transition count 286
Applied a total of 79 rules in 26 ms. Remains 116 /156 variables (removed 40) and now considering 286/382 (removed 96) transitions.
[2024-05-23 02:46:42] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 116 cols
[2024-05-23 02:46:42] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:46:42] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:46:42] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2024-05-23 02:46:42] [INFO ] Invariant cache hit.
[2024-05-23 02:46:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:46:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-23 02:46:43] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2024-05-23 02:46:43] [INFO ] Invariant cache hit.
[2024-05-23 02:46:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 194/310 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 161 constraints, problems are : Problem set: 0 solved, 284 unsolved in 7690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 194/310 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 284/445 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 445 constraints, problems are : Problem set: 0 solved, 284 unsolved in 8738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 16647ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 16651ms
Starting structural reductions in LTL mode, iteration 1 : 116/156 places, 286/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16902 ms. Remains : 116/156 places, 286/382 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p2), true, (OR p0 (AND (NOT p1) p2)), p0, p0]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-12 finished in 17163 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||G(p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 150 transition count 370
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 150 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 150 transition count 368
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 146 transition count 358
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 146 transition count 358
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 142 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 138 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 138 transition count 334
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 135 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 135 transition count 328
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 132 transition count 318
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 132 transition count 318
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 129 transition count 308
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 129 transition count 308
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 126 transition count 302
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 126 transition count 302
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 124 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 124 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 122 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 122 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 120 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 120 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 118 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 118 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 118 transition count 280
Applied a total of 84 rules in 37 ms. Remains 118 /156 variables (removed 38) and now considering 280/382 (removed 102) transitions.
[2024-05-23 02:46:59] [INFO ] Flow matrix only has 192 transitions (discarded 88 similar events)
// Phase 1: matrix 192 rows 118 cols
[2024-05-23 02:46:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:47:00] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 02:47:00] [INFO ] Flow matrix only has 192 transitions (discarded 88 similar events)
[2024-05-23 02:47:00] [INFO ] Invariant cache hit.
[2024-05-23 02:47:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-23 02:47:00] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-23 02:47:00] [INFO ] Redundant transitions in 1 ms returned []
Running 278 sub problems to find dead transitions.
[2024-05-23 02:47:00] [INFO ] Flow matrix only has 192 transitions (discarded 88 similar events)
[2024-05-23 02:47:00] [INFO ] Invariant cache hit.
[2024-05-23 02:47:00] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 192/309 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 44/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/310 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 164 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8539 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 192/309 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 44/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 32/195 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 246/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 442 constraints, problems are : Problem set: 0 solved, 278 unsolved in 11839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
After SMT, in 20635ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 20638ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/156 places, 280/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20927 ms. Remains : 118/156 places, 280/382 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-14
Stuttering criterion allowed to conclude after 1038 steps with 5 reset in 4 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-14 finished in 21019 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((X(G(p0))&&(p1||G(F(p1)))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 382/382 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 147 transition count 366
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 147 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 142 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 137 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 137 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 133 transition count 326
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 133 transition count 326
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 129 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 129 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 125 transition count 302
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 125 transition count 302
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 121 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 121 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 117 transition count 282
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 114 transition count 276
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 111 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 108 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 106 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 106 transition count 260
Applied a total of 101 rules in 12 ms. Remains 106 /156 variables (removed 50) and now considering 260/382 (removed 122) transitions.
[2024-05-23 02:47:20] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2024-05-23 02:47:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:47:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 02:47:21] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-23 02:47:21] [INFO ] Invariant cache hit.
[2024-05-23 02:47:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:47:21] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-23 02:47:21] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-23 02:47:21] [INFO ] Invariant cache hit.
[2024-05-23 02:47:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 406 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8097 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 15030ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15034ms
Starting structural reductions in LTL mode, iteration 1 : 106/156 places, 260/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15272 ms. Remains : 106/156 places, 260/382 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-15 finished in 15445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-23 02:47:36] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:47:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-23 02:47:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 382 transitions and 1538 arcs took 5 ms.
Total runtime 193389 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b016

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 156
TRANSITIONS: 382
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


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


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

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

Process ID: 882
MODEL NAME: /home/mcc/execution/406/model
156 places, 382 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716432458195

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-b016, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601100243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;