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

--------------------
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 1717188796192

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:53:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:53:17] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-31 20:53:17] [INFO ] Transformed 306 places.
[2024-05-31 20:53:17] [INFO ] Transformed 840 transitions.
[2024-05-31 20:53:17] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 212 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 6 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 111 ms. Remains 156 /222 variables (removed 66) and now considering 382/648 (removed 266) transitions.
[2024-05-31 20:53:17] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
// Phase 1: matrix 265 rows 156 cols
[2024-05-31 20:53:17] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 20:53:18] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 20:53:18] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
[2024-05-31 20:53:18] [INFO ] Invariant cache hit.
[2024-05-31 20:53:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 20:53:18] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-05-31 20:53:18] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
[2024-05-31 20:53:18] [INFO ] Invariant cache hit.
[2024-05-31 20:53:18] [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 14609 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 20178 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 35371ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 35386ms
Starting structural reductions in LTL mode, iteration 1 : 156/222 places, 382/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36079 ms. Remains : 156/222 places, 382/648 transitions.
Support contains 20 out of 156 places after structural reductions.
[2024-05-31 20:53:53] [INFO ] Flatten gal took : 49 ms
[2024-05-31 20:53:53] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:53:54] [INFO ] Input system was already deterministic with 382 transitions.
RANDOM walk for 40002 steps (40 resets) in 1228 ms. (32 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (18 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2024-05-31 20:53:54] [INFO ] Flow matrix only has 265 transitions (discarded 117 similar events)
[2024-05-31 20:53:54] [INFO ] Invariant cache hit.
[2024-05-31 20:53:54] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/76 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 135/211 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 388/421 variables, and 144 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/156 constraints, ReadFeed: 11/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 91 ms. Remains 108 /156 variables (removed 48) and now considering 260/382 (removed 122) transitions.
[2024-05-31 20:53:54] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2024-05-31 20:53:54] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:53:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:53:54] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:53:54] [INFO ] Invariant cache hit.
[2024-05-31 20:53:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:53:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-31 20:53:55] [INFO ] Redundant transitions in 11 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 20:53:55] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:53:55] [INFO ] Invariant cache hit.
[2024-05-31 20:53:55] [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 6439 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 7632 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 14326ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14330ms
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 14662 ms. Remains : 108/156 places, 260/382 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-00
Product exploration explored 100000 steps with 642 reset in 374 ms.
Product exploration explored 100000 steps with 572 reset in 296 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 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 23739 steps (24 resets) in 73 ms. (320 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 75 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)]
Stuttering acceptance computed with spot in 38 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 15 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-31 20:54:10] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:54:10] [INFO ] Invariant cache hit.
[2024-05-31 20:54:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 20:54:10] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:54:10] [INFO ] Invariant cache hit.
[2024-05-31 20:54:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:54:10] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-31 20:54:10] [INFO ] Redundant transitions in 4 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 20:54:10] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:54:10] [INFO ] Invariant cache hit.
[2024-05-31 20:54:10] [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 6437 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 7834 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 14449ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14453ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14690 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 67 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 40 ms :[(NOT p0)]
RANDOM walk for 13962 steps (18 resets) in 35 ms. (387 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 548 reset in 253 ms.
Product exploration explored 100000 steps with 586 reset in 266 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 14 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-31 20:54:26] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:54:26] [INFO ] Invariant cache hit.
[2024-05-31 20:54:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 20:54:26] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:54:26] [INFO ] Invariant cache hit.
[2024-05-31 20:54:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 20:54:26] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-31 20:54:26] [INFO ] Redundant transitions in 4 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 20:54:26] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2024-05-31 20:54:26] [INFO ] Invariant cache hit.
[2024-05-31 20:54:26] [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 6412 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 7759 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 14340ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14342ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14573 ms. Remains : 108/108 places, 260/260 transitions.
Treatment of property FunctionPointer-PT-b016-LTLCardinality-00 finished in 46052 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 21 ms. Remains 108 /156 variables (removed 48) and now considering 264/382 (removed 118) transitions.
[2024-05-31 20:54:40] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 108 cols
[2024-05-31 20:54:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:54:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 20:54:40] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 20:54:40] [INFO ] Invariant cache hit.
[2024-05-31 20:54:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 20:54:41] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-31 20:54:41] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 20:54:41] [INFO ] Invariant cache hit.
[2024-05-31 20:54:41] [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 7126 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 7681 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 14985ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14987ms
Starting structural reductions in LTL mode, iteration 1 : 108/156 places, 264/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15230 ms. Remains : 108/156 places, 264/382 transitions.
Stuttering acceptance computed with spot in 119 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 244 ms.
Product exploration explored 100000 steps with 50000 reset in 202 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 16 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 15835 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.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 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 47 ms. Remains 97 /156 variables (removed 59) and now considering 234/382 (removed 148) transitions.
[2024-05-31 20:54:56] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:54:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:54:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 20:54:56] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:54:56] [INFO ] Invariant cache hit.
[2024-05-31 20:54:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:54:56] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-31 20:54:56] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:54:56] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:54:56] [INFO ] Invariant cache hit.
[2024-05-31 20:54:56] [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 5796 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 6784 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 12729ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12732ms
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 12975 ms. Remains : 97/156 places, 234/382 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-07
Stuttering criterion allowed to conclude after 1797 steps with 9 reset in 11 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-07 finished in 13046 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 48 ms. Remains 98 /156 variables (removed 58) and now considering 236/382 (removed 146) transitions.
[2024-05-31 20:55:09] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2024-05-31 20:55:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:55:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 20:55:09] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2024-05-31 20:55:09] [INFO ] Invariant cache hit.
[2024-05-31 20:55:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 20:55:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-31 20:55:09] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-31 20:55:09] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2024-05-31 20:55:09] [INFO ] Invariant cache hit.
[2024-05-31 20:55:09] [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 5770 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 6550 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 12467ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12471ms
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 12726 ms. Remains : 98/156 places, 236/382 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-08
Stuttering criterion allowed to conclude after 509 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-08 finished in 12790 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 30 ms. Remains 97 /156 variables (removed 59) and now considering 236/382 (removed 146) transitions.
[2024-05-31 20:55:22] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 20:55:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:55:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 20:55:22] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 20:55:22] [INFO ] Invariant cache hit.
[2024-05-31 20:55:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:55:22] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 20:55:22] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 20:55:22] [INFO ] Invariant cache hit.
[2024-05-31 20:55:22] [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 5820 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 6824 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 12787ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12791ms
Starting structural reductions in LTL mode, iteration 1 : 97/156 places, 236/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13021 ms. Remains : 97/156 places, 236/382 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-09
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-09 finished in 13115 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 38 ms. Remains 116 /156 variables (removed 40) and now considering 286/382 (removed 96) transitions.
[2024-05-31 20:55:35] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 116 cols
[2024-05-31 20:55:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:55:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:55:35] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2024-05-31 20:55:35] [INFO ] Invariant cache hit.
[2024-05-31 20:55:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:55:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-31 20:55:35] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2024-05-31 20:55:35] [INFO ] Invariant cache hit.
[2024-05-31 20:55:35] [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 7887 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 9207 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 17315ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 17318ms
Starting structural reductions in LTL mode, iteration 1 : 116/156 places, 286/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17599 ms. Remains : 116/156 places, 286/382 transitions.
Stuttering acceptance computed with spot in 255 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 0 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-12 finished in 17883 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 35 ms. Remains 118 /156 variables (removed 38) and now considering 280/382 (removed 102) transitions.
[2024-05-31 20:55:53] [INFO ] Flow matrix only has 192 transitions (discarded 88 similar events)
// Phase 1: matrix 192 rows 118 cols
[2024-05-31 20:55:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:55:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:55:53] [INFO ] Flow matrix only has 192 transitions (discarded 88 similar events)
[2024-05-31 20:55:53] [INFO ] Invariant cache hit.
[2024-05-31 20:55:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-31 20:55:53] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 20:55:53] [INFO ] Redundant transitions in 1 ms returned []
Running 278 sub problems to find dead transitions.
[2024-05-31 20:55:53] [INFO ] Flow matrix only has 192 transitions (discarded 88 similar events)
[2024-05-31 20:55:53] [INFO ] Invariant cache hit.
[2024-05-31 20:55:53] [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 8852 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 12000 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 21044ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 21047ms
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 21319 ms. Remains : 118/156 places, 280/382 transitions.
Stuttering acceptance computed with spot in 78 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 118 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-14 finished in 21413 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 18 ms. Remains 106 /156 variables (removed 50) and now considering 260/382 (removed 122) transitions.
[2024-05-31 20:56:14] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2024-05-31 20:56:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:56:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:56:14] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 20:56:14] [INFO ] Invariant cache hit.
[2024-05-31 20:56:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:56:15] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-31 20:56:15] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 20:56:15] [INFO ] Invariant cache hit.
[2024-05-31 20:56:15] [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 6893 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 7994 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 15062ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15065ms
Starting structural reductions in LTL mode, iteration 1 : 106/156 places, 260/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15291 ms. Remains : 106/156 places, 260/382 transitions.
Stuttering acceptance computed with spot in 173 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 4 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-15 finished in 15482 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-31 20:56:30] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:56:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:56:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 382 transitions and 1538 arcs took 6 ms.
Total runtime 193283 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b016-LTLCardinality-00

BK_STOP 1717188998769

--------------------
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
mcc2024
ltl formula name FunctionPointer-PT-b016-LTLCardinality-00
ltl formula formula --ltl=/tmp/861/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 156 places, 382 transitions and 1538 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/861/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/861/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/861/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/861/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 156 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 157, there are 386 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2448 levels ~10000 states ~46484 transitions
pnml2lts-mc( 1/ 4): ~4890 levels ~20000 states ~93756 transitions
pnml2lts-mc( 1/ 4): ~9775 levels ~40000 states ~188188 transitions
pnml2lts-mc( 1/ 4): ~19544 levels ~80000 states ~377148 transitions
pnml2lts-mc( 1/ 4): ~39084 levels ~160000 states ~755088 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1471940 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~2943940 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~5887940 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1527498
pnml2lts-mc( 0/ 4): unique transitions count: 7124026
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 368863
pnml2lts-mc( 0/ 4): - claim success count: 1527518
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1518715
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1527518 states 7124099 transitions, fanout: 4.664
pnml2lts-mc( 0/ 4): Total exploration time 7.680 sec (7.640 sec minimum, 7.653 sec on average)
pnml2lts-mc( 0/ 4): States per second: 198896, Transitions per second: 927617
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 112.1MB, 18.6 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 385 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 112.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r496-tall-171640603000243"
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 ;