Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 16:07 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-b128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716433076179

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:57:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:57:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:57:57] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-23 02:57:57] [INFO ] Transformed 306 places.
[2024-05-23 02:57:57] [INFO ] Transformed 840 transitions.
[2024-05-23 02:57:57] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 32 place count 190 transition count 582
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 582
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 142 place count 190 transition count 494
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 151 place count 181 transition count 476
Iterating global reduction 2 with 9 rules applied. Total rules applied 160 place count 181 transition count 476
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 188 place count 181 transition count 448
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 194 place count 175 transition count 436
Iterating global reduction 3 with 6 rules applied. Total rules applied 200 place count 175 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 205 place count 170 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 210 place count 170 transition count 416
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 165 transition count 406
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 165 transition count 406
Applied a total of 220 rules in 78 ms. Remains 165 /222 variables (removed 57) and now considering 406/648 (removed 242) transitions.
[2024-05-23 02:57:57] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
// Phase 1: matrix 275 rows 165 cols
[2024-05-23 02:57:57] [INFO ] Computed 2 invariants in 20 ms
[2024-05-23 02:57:58] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-23 02:57:58] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-23 02:57:58] [INFO ] Invariant cache hit.
[2024-05-23 02:57:58] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-23 02:57:58] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-23 02:57:58] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-23 02:57:58] [INFO ] Invariant cache hit.
[2024-05-23 02:57:58] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/440 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 59/226 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 226 constraints, problems are : Problem set: 0 solved, 404 unsolved in 14273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/440 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 59/226 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 404/630 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 630 constraints, problems are : Problem set: 0 solved, 404 unsolved in 16281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 31164ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 31184ms
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31863 ms. Remains : 165/222 places, 406/648 transitions.
Support contains 27 out of 165 places after structural reductions.
[2024-05-23 02:58:29] [INFO ] Flatten gal took : 52 ms
[2024-05-23 02:58:29] [INFO ] Flatten gal took : 24 ms
[2024-05-23 02:58:29] [INFO ] Input system was already deterministic with 406 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40005 steps (20 resets) in 1106 ms. (36 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (24 resets) in 144 ms. (275 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
[2024-05-23 02:58:30] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-23 02:58:30] [INFO ] Invariant cache hit.
[2024-05-23 02:58:30] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 141/166 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 201/367 variables, 93/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 49/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/373 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 67/440 variables, 47/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/440 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 226 constraints, problems are : Problem set: 1 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/69 variables, 21/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 10/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 138/207 variables, 20/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 193/400 variables, 97/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 49/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/406 variables, 1/200 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 31/437 variables, 25/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/440 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/440 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 227 constraints, problems are : Problem set: 1 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 406/406 transitions.
Graph (complete) has 651 edges and 165 vertex of which 141 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 141 transition count 358
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 132 transition count 338
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 132 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 132 transition count 336
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 77 place count 124 transition count 320
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 124 transition count 320
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 117 transition count 292
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 117 transition count 292
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 110 transition count 266
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 110 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 104 transition count 252
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 104 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 98 transition count 238
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 98 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 92 transition count 226
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 92 transition count 226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 86 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 86 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 80 transition count 202
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 80 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 79 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 79 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 78 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 78 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 78 transition count 196
Applied a total of 179 rules in 64 ms. Remains 78 /165 variables (removed 87) and now considering 196/406 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 78/165 places, 196/406 transitions.
RANDOM walk for 26050 steps (5 resets) in 150 ms. (172 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b128-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b128-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b128-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
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(p1)&&p0) U G(!p2))||(F(p1)&&F(p2))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 111 transition count 268
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 114 place count 111 transition count 264
Applied a total of 114 rules in 66 ms. Remains 111 /165 variables (removed 54) and now considering 264/406 (removed 142) transitions.
[2024-05-23 02:58:31] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-23 02:58:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:58:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:58:31] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:58:31] [INFO ] Invariant cache hit.
[2024-05-23 02:58:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:58:31] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-23 02:58:31] [INFO ] Redundant transitions in 11 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-23 02:58:31] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:58:31] [INFO ] Invariant cache hit.
[2024-05-23 02:58:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 14339ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14342ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/165 places, 264/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14621 ms. Remains : 111/165 places, 264/406 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-00
Stuttering criterion allowed to conclude after 534 steps with 7 reset in 14 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-00 finished in 14905 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)))) U p2))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 111 transition count 268
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 114 place count 111 transition count 264
Applied a total of 114 rules in 41 ms. Remains 111 /165 variables (removed 54) and now considering 264/406 (removed 142) transitions.
[2024-05-23 02:58:46] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:58:46] [INFO ] Invariant cache hit.
[2024-05-23 02:58:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:58:46] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:58:46] [INFO ] Invariant cache hit.
[2024-05-23 02:58:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:58:46] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-23 02:58:46] [INFO ] Redundant transitions in 3 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-23 02:58:46] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-23 02:58:46] [INFO ] Invariant cache hit.
[2024-05-23 02:58:46] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 15162ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/165 places, 264/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15469 ms. Remains : 111/165 places, 264/406 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-01
Product exploration explored 100000 steps with 1381 reset in 295 ms.
Stack based approach found an accepted trace after 44552 steps with 590 reset with depth 151 and stack size 151 in 131 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-01 finished in 16069 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))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 143 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 143 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 136 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 136 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 118 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 112 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 112 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 106 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 106 transition count 258
Applied a total of 120 rules in 21 ms. Remains 106 /165 variables (removed 59) and now considering 258/406 (removed 148) transitions.
[2024-05-23 02:59:02] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-23 02:59:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:59:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:59:02] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-23 02:59:02] [INFO ] Invariant cache hit.
[2024-05-23 02:59:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:59:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:59:02] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-23 02:59:02] [INFO ] Invariant cache hit.
[2024-05-23 02:59:02] [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, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6864 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: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 256/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 404 constraints, problems are : Problem set: 0 solved, 256 unsolved in 7137 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: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 14199ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 14201ms
Starting structural reductions in LTL mode, iteration 1 : 106/165 places, 258/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14416 ms. Remains : 106/165 places, 258/406 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-02 finished in 14520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 390
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 158 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 152 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 147 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 142 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 142 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 137 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 137 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 132 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 122 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 122 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 117 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 115 transition count 280
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 108 place count 115 transition count 274
Applied a total of 108 rules in 39 ms. Remains 115 /165 variables (removed 50) and now considering 274/406 (removed 132) transitions.
[2024-05-23 02:59:16] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 115 cols
[2024-05-23 02:59:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:59:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 02:59:16] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2024-05-23 02:59:16] [INFO ] Invariant cache hit.
[2024-05-23 02:59:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:59:16] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-23 02:59:16] [INFO ] Redundant transitions in 6 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-23 02:59:16] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2024-05-23 02:59:16] [INFO ] Invariant cache hit.
[2024-05-23 02:59:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/301 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 272 unsolved in 7492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/301 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 272/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 432 constraints, problems are : Problem set: 0 solved, 272 unsolved in 8356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 16051ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 16054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/165 places, 274/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16361 ms. Remains : 115/165 places, 274/406 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-03
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-03 finished in 16487 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((G(!G(p0)) U !p1))) U (p0 U p2)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 392
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 158 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 152 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 152 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 147 transition count 358
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 147 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 142 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 142 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 138 transition count 330
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 138 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 134 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 134 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 130 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 126 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 122 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 122 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 121 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 121 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 120 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 120 transition count 292
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 98 place count 120 transition count 286
Applied a total of 98 rules in 35 ms. Remains 120 /165 variables (removed 45) and now considering 286/406 (removed 120) transitions.
[2024-05-23 02:59:33] [INFO ] Flow matrix only has 197 transitions (discarded 89 similar events)
// Phase 1: matrix 197 rows 120 cols
[2024-05-23 02:59:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:59:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 02:59:33] [INFO ] Flow matrix only has 197 transitions (discarded 89 similar events)
[2024-05-23 02:59:33] [INFO ] Invariant cache hit.
[2024-05-23 02:59:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-23 02:59:33] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-23 02:59:33] [INFO ] Redundant transitions in 1 ms returned []
Running 284 sub problems to find dead transitions.
[2024-05-23 02:59:33] [INFO ] Flow matrix only has 197 transitions (discarded 89 similar events)
[2024-05-23 02:59:33] [INFO ] Invariant cache hit.
[2024-05-23 02:59:33] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 197/317 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 46/168 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/317 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 168 constraints, problems are : Problem set: 0 solved, 284 unsolved in 7267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 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/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 197/317 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 46/168 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 284/452 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 452 constraints, problems are : Problem set: 0 solved, 284 unsolved in 8404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 15886ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 15889ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/165 places, 286/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16187 ms. Remains : 120/165 places, 286/406 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-05
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-05 finished in 16322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 114 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 108 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 106 transition count 258
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 124 place count 106 transition count 254
Applied a total of 124 rules in 31 ms. Remains 106 /165 variables (removed 59) and now considering 254/406 (removed 152) transitions.
[2024-05-23 02:59:49] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-23 02:59:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:59:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 02:59:49] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:59:49] [INFO ] Invariant cache hit.
[2024-05-23 02:59:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:59:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-23 02:59:49] [INFO ] Redundant transitions in 0 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 02:59:49] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:59:49] [INFO ] Invariant cache hit.
[2024-05-23 02:59:49] [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, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6402 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: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7030 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: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 13606ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 13610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13866 ms. Remains : 106/165 places, 254/406 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-07
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-07 finished in 13959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 386
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 148 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 148 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 127 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 127 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 120 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 120 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 114 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 108 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 108 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 102 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 102 transition count 246
Applied a total of 128 rules in 11 ms. Remains 102 /165 variables (removed 63) and now considering 246/406 (removed 160) transitions.
[2024-05-23 03:00:03] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2024-05-23 03:00:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 03:00:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 03:00:03] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 03:00:03] [INFO ] Invariant cache hit.
[2024-05-23 03:00:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 03:00:03] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2024-05-23 03:00:03] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 03:00:03] [INFO ] Invariant cache hit.
[2024-05-23 03:00:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 144 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6345 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 244/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/270 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 388 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 13206ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 13209ms
Starting structural reductions in LTL mode, iteration 1 : 102/165 places, 246/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13431 ms. Remains : 102/165 places, 246/406 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-09
Entered a terminal (fully accepting) state of product in 569 steps with 6 reset in 5 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-09 finished in 13518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 386
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 148 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 148 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 127 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 127 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 121 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 121 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 109 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 103 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 101 transition count 244
Applied a total of 130 rules in 18 ms. Remains 101 /165 variables (removed 64) and now considering 244/406 (removed 162) transitions.
[2024-05-23 03:00:16] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
// Phase 1: matrix 166 rows 101 cols
[2024-05-23 03:00:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 03:00:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 03:00:16] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-23 03:00:16] [INFO ] Invariant cache hit.
[2024-05-23 03:00:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 03:00:17] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-23 03:00:17] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-23 03:00:17] [INFO ] Invariant cache hit.
[2024-05-23 03:00:17] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 143 constraints, problems are : Problem set: 0 solved, 242 unsolved in 5867 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 242/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 385 constraints, problems are : Problem set: 0 solved, 242 unsolved in 6357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 12399ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 12401ms
Starting structural reductions in LTL mode, iteration 1 : 101/165 places, 244/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12651 ms. Remains : 101/165 places, 244/406 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-10
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-10 finished in 12737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p1)&&p0)||X((G(!p2)||(!p2&&F(p3)))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 388
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 139 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 139 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 134 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 134 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 129 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 129 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 114 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 114 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 113 transition count 274
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 113 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 112 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 112 transition count 272
Applied a total of 108 rules in 18 ms. Remains 112 /165 variables (removed 53) and now considering 272/406 (removed 134) transitions.
[2024-05-23 03:00:29] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
// Phase 1: matrix 185 rows 112 cols
[2024-05-23 03:00:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 03:00:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 03:00:29] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2024-05-23 03:00:29] [INFO ] Invariant cache hit.
[2024-05-23 03:00:29] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 03:00:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-23 03:00:29] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2024-05-23 03:00:29] [INFO ] Invariant cache hit.
[2024-05-23 03:00:29] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 185/297 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 157 constraints, problems are : Problem set: 0 solved, 270 unsolved in 7260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 185/297 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 270/427 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 427 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 15787ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 15790ms
Starting structural reductions in LTL mode, iteration 1 : 112/165 places, 272/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16032 ms. Remains : 112/165 places, 272/406 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p3), p2, (AND (NOT p1) p2), (AND (NOT p3) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-11
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 16317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 386
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 156 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 148 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 148 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 128 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 128 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 122 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 122 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 116 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 116 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 110 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 104 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 103 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 102 transition count 246
Applied a total of 128 rules in 16 ms. Remains 102 /165 variables (removed 63) and now considering 246/406 (removed 160) transitions.
[2024-05-23 03:00:45] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2024-05-23 03:00:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 03:00:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 03:00:45] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 03:00:45] [INFO ] Invariant cache hit.
[2024-05-23 03:00:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 03:00:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2024-05-23 03:00:46] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2024-05-23 03:00:46] [INFO ] Invariant cache hit.
[2024-05-23 03:00:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 144 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 244/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/270 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 388 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 12974ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 12977ms
Starting structural reductions in LTL mode, iteration 1 : 102/165 places, 246/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13209 ms. Remains : 102/165 places, 246/406 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-13
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-13 finished in 13390 ms.
All properties solved by simple procedures.
Total runtime 181996 ms.
ITS solved all properties within timeout

BK_STOP 1716433259316

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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