Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
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 r100-smll-174867007400108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml 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 1748806326809

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 19:32:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 19:32:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 19:32:09] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2025-06-01 19:32:09] [INFO ] Transformed 306 places.
[2025-06-01 19:32:09] [INFO ] Transformed 840 transitions.
[2025-06-01 19:32:09] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 554 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 13 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 568
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 568
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 130 place count 190 transition count 492
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 140 place count 180 transition count 472
Iterating global reduction 2 with 10 rules applied. Total rules applied 150 place count 180 transition count 472
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 174 place count 180 transition count 448
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 180 place count 174 transition count 436
Iterating global reduction 3 with 6 rules applied. Total rules applied 186 place count 174 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 191 place count 169 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 196 place count 169 transition count 416
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 165 transition count 408
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 165 transition count 408
Applied a total of 204 rules in 186 ms. Remains 165 /222 variables (removed 57) and now considering 408/648 (removed 240) transitions.
[2025-06-01 19:32:10] [INFO ] Flow matrix only has 276 transitions (discarded 132 similar events)
// Phase 1: matrix 276 rows 165 cols
[2025-06-01 19:32:10] [INFO ] Computed 2 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:32:11] [INFO ] Implicit Places using invariants in 692 ms returned []
[2025-06-01 19:32:11] [INFO ] Flow matrix only has 276 transitions (discarded 132 similar events)
[2025-06-01 19:32:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:32:11] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-01 19:32:11] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2025-06-01 19:32:11] [INFO ] Flow matrix only has 276 transitions (discarded 132 similar events)
[2025-06-01 19:32:11] [INFO ] Invariant cache hit.
[2025-06-01 19:32:11] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 276/441 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 59/226 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 406 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 226 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30035 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: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 276/441 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 59/226 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 406/632 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:33:02] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 633 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30030 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: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60975ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 408/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62596 ms. Remains : 165/222 places, 408/648 transitions.
Support contains 26 out of 165 places after structural reductions.
[2025-06-01 19:33:13] [INFO ] Flatten gal took : 111 ms
[2025-06-01 19:33:13] [INFO ] Flatten gal took : 64 ms
[2025-06-01 19:33:13] [INFO ] Input system was already deterministic with 408 transitions.
RANDOM walk for 40300 steps (28 resets) in 1175 ms. (34 steps per ms) remains 0/22 properties
FORMULA FunctionPointer-PT-b128-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(!p2)&&(!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 390
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 157 transition count 386
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 151 transition count 372
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 151 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 146 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 146 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 141 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 141 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 136 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 136 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 131 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 131 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 121 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 118 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 118 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 117 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 116 transition count 282
Applied a total of 102 rules in 46 ms. Remains 116 /165 variables (removed 49) and now considering 282/408 (removed 126) transitions.
[2025-06-01 19:33:14] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
// Phase 1: matrix 192 rows 116 cols
[2025-06-01 19:33:14] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:33:14] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-01 19:33:14] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 19:33:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:33:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-01 19:33:15] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2025-06-01 19:33:15] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 19:33:15] [INFO ] Invariant cache hit.
[2025-06-01 19:33:15] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/308 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 163 constraints, problems are : Problem set: 0 solved, 280 unsolved in 14810 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/308 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 280/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 443 constraints, problems are : Problem set: 0 solved, 280 unsolved in 25937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40983ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 40987ms
Starting structural reductions in LTL mode, iteration 1 : 116/165 places, 282/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41865 ms. Remains : 116/165 places, 282/408 transitions.
Stuttering acceptance computed with spot in 427 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1) p2), (AND p0 (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 601 ms.
Product exploration explored 100000 steps with 33333 reset in 431 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 32 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLFireability-00 finished in 43462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((X(X((!p0 U F(p0)))) U p1)))||X(p2)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 390
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 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 18 place count 157 transition count 388
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 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 138 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 120 transition count 288
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 120 transition count 288
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 114 transition count 276
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 110 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 108 transition count 264
Applied a total of 116 rules in 53 ms. Remains 108 /165 variables (removed 57) and now considering 264/408 (removed 144) transitions.
[2025-06-01 19:33:57] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2025-06-01 19:33:57] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:33:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 19:33:57] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2025-06-01 19:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:33:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 19:33:58] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-01 19:33:58] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2025-06-01 19:33:58] [INFO ] Invariant cache hit.
[2025-06-01 19:33:58] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 152 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 262/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 414 constraints, problems are : Problem set: 0 solved, 262 unsolved in 21830 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34915ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 34919ms
Starting structural reductions in LTL mode, iteration 1 : 108/165 places, 264/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35353 ms. Remains : 108/165 places, 264/408 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-02
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-02 finished in 35595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 147 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 147 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 140 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 140 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 133 transition count 312
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 133 transition count 312
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 126 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 126 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 119 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 119 transition count 280
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 112 transition count 266
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 112 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 117 place count 105 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 124 place count 105 transition count 252
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 130 place count 99 transition count 240
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 97 transition count 234
Applied a total of 142 rules in 82 ms. Remains 97 /165 variables (removed 68) and now considering 234/408 (removed 174) transitions.
[2025-06-01 19:34:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2025-06-01 19:34:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:34:33] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-01 19:34:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2025-06-01 19:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:34:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 19:34:33] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:34:33] [INFO ] Redundant transitions in 20 ms returned []
Running 232 sub problems to find dead transitions.
[2025-06-01 19:34:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2025-06-01 19:34:33] [INFO ] Invariant cache hit.
[2025-06-01 19:34:33] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 11009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:34:53] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:34:54] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 370 constraints, problems are : Problem set: 0 solved, 232 unsolved in 29381 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40521ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 40523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/165 places, 234/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41045 ms. Remains : 97/165 places, 234/408 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-03
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-03 finished in 41112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/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, 408/408 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 147 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 147 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 140 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 140 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 133 transition count 312
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 133 transition count 312
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 126 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 126 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 119 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 119 transition count 280
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 112 transition count 266
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 112 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 117 place count 105 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 124 place count 105 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 100 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 98 transition count 236
Applied a total of 140 rules in 62 ms. Remains 98 /165 variables (removed 67) and now considering 236/408 (removed 172) transitions.
[2025-06-01 19:35:14] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2025-06-01 19:35:14] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:35:14] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-01 19:35:14] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2025-06-01 19:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:35:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 19:35:14] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:35:15] [INFO ] Redundant transitions in 20 ms returned []
Running 234 sub problems to find dead transitions.
[2025-06-01 19:35:15] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2025-06-01 19:35:15] [INFO ] Invariant cache hit.
[2025-06-01 19:35:15] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 139 constraints, problems are : Problem set: 0 solved, 234 unsolved in 11540 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 234/373 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:35:36] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 374 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41662ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 41663ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/165 places, 236/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42257 ms. Remains : 98/165 places, 236/408 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-05
Stuttering criterion allowed to conclude after 39 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 42364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X((X(X(!p1))&&G(!p2)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 156 transition count 384
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 149 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 149 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 144 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 144 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 139 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 139 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 134 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 134 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 129 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 129 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 115 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 114 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 113 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 113 transition count 276
Applied a total of 108 rules in 17 ms. Remains 113 /165 variables (removed 52) and now considering 276/408 (removed 132) transitions.
[2025-06-01 19:35:56] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
// Phase 1: matrix 187 rows 113 cols
[2025-06-01 19:35:56] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:35:57] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-01 19:35:57] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
[2025-06-01 19:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:35:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 19:35:57] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-01 19:35:57] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
[2025-06-01 19:35:57] [INFO ] Invariant cache hit.
[2025-06-01 19:35:57] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 187/300 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 158 constraints, problems are : Problem set: 0 solved, 274 unsolved in 13895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 187/300 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 274/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 432 constraints, problems are : Problem set: 0 solved, 274 unsolved in 27010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41068ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 41070ms
Starting structural reductions in LTL mode, iteration 1 : 113/165 places, 276/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41890 ms. Remains : 113/165 places, 276/408 transitions.
Stuttering acceptance computed with spot in 811 ms :[(OR p2 p1), (OR p1 p2), (OR p2 p1), true, p1, p2, p1, p0, p2, p1, (AND p0 p1), (AND p1 p0 (NOT p2)), (OR (AND p1 p2) (AND p0 p1)), p1, (AND p2 p1), p1, p1, p1, p1]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-06
Entered a terminal (fully accepting) state of product in 12999 steps with 272 reset in 123 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-06 finished in 42864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (G(p2)||p1)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 390
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 156 transition count 386
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 149 transition count 370
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 149 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 143 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 137 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 137 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 131 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 125 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 119 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 119 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 113 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 113 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 108 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 106 transition count 260
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 126 place count 106 transition count 256
Applied a total of 126 rules in 79 ms. Remains 106 /165 variables (removed 59) and now considering 256/408 (removed 152) transitions.
[2025-06-01 19:36:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2025-06-01 19:36:39] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:36:39] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-01 19:36:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:36:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 19:36:40] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:36:40] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 19:36:40] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:36:40] [INFO ] Invariant cache hit.
[2025-06-01 19:36:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12165 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: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:37:12] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/280 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 403 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30021 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: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42265ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 42267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 256/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43072 ms. Remains : 106/165 places, 256/408 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-07
Product exploration explored 100000 steps with 33426 reset in 366 ms.
Product exploration explored 100000 steps with 33371 reset in 516 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 180 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
RANDOM walk for 32384 steps (26 resets) in 240 ms. (134 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 15 factoid took 513 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
[2025-06-01 19:37:25] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:37:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:37:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 19:37:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 19:37:25] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-01 19:37:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:37:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 19:37:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 12 ms returned sat
[2025-06-01 19:37:26] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-01 19:37:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 19:37:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 26 ms returned sat
[2025-06-01 19:37:26] [INFO ] Computed and/alt/rep : 44/76/38 causal constraints (skipped 134 transitions) in 33 ms.
[2025-06-01 19:37:26] [INFO ] Added : 16 causal constraints over 4 iterations in 189 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-06-01 19:37:26] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:37:26] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-01 19:37:26] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:37:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 19:37:27] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:37:27] [INFO ] Redundant transitions in 5 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 19:37:27] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:37:27] [INFO ] Invariant cache hit.
[2025-06-01 19:37:27] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12982 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: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:38:00] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/280 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 403 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30020 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: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43186ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43891 ms. Remains : 106/106 places, 256/256 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 199 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
RANDOM walk for 40141 steps (25 resets) in 159 ms. (250 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2025-06-01 19:38:10] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:38:10] [INFO ] Invariant cache hit.
[2025-06-01 19:38:10] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/227 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 31/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/233 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/234 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/273 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/277 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/280 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 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: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/227 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 31/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/233 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/234 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/273 variables, 29/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/277 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/277 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/280 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 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: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50479 steps, including 572 resets, run visited all 1 properties in 210 ms. (steps per millisecond=240 )
Parikh walk visited 1 properties in 219 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 15 factoid took 534 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
[2025-06-01 19:38:12] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 19:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:38:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-01 19:38:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 19:38:13] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2025-06-01 19:38:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:38:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-06-01 19:38:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-01 19:38:13] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-06-01 19:38:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 19:38:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 28 ms returned sat
[2025-06-01 19:38:13] [INFO ] Computed and/alt/rep : 44/76/38 causal constraints (skipped 134 transitions) in 34 ms.
[2025-06-01 19:38:14] [INFO ] Added : 16 causal constraints over 4 iterations in 197 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 33244 reset in 364 ms.
Product exploration explored 100000 steps with 33267 reset in 386 ms.
Built C files in :
/tmp/ltsmin2944592154498912031
[2025-06-01 19:38:15] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2025-06-01 19:38:15] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:38:15] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2025-06-01 19:38:15] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:38:15] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2025-06-01 19:38:15] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:38:15] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2944592154498912031
Running compilation step : cd /tmp/ltsmin2944592154498912031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1290 ms.
Running link step : cd /tmp/ltsmin2944592154498912031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin2944592154498912031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5861485927871804111.hoa' '--buchi-type=spotba'
LTSmin run took 740 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b128-LTLFireability-07 finished in 97627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 156 transition count 384
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 149 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 149 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 143 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 143 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 137 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 137 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 131 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 125 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 119 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 113 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 109 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 107 transition count 260
Applied a total of 120 rules in 32 ms. Remains 107 /165 variables (removed 58) and now considering 260/408 (removed 148) transitions.
[2025-06-01 19:38:17] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 107 cols
[2025-06-01 19:38:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:38:17] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-01 19:38:17] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 19:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:38:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 19:38:18] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-01 19:38:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 19:38:18] [INFO ] Invariant cache hit.
[2025-06-01 19:38:18] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/284 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/284 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:38:40] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 410 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43255ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43257ms
Starting structural reductions in LTL mode, iteration 1 : 107/165 places, 260/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44036 ms. Remains : 107/165 places, 260/408 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-09
Entered a terminal (fully accepting) state of product in 910 steps with 10 reset in 17 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-09 finished in 44297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/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, 408/408 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 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 20 place count 156 transition count 386
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 316
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 134 transition count 316
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 120 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 113 transition count 270
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 113 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 107 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 107 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 124 place count 101 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 99 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 99 transition count 240
Applied a total of 136 rules in 55 ms. Remains 99 /165 variables (removed 66) and now considering 240/408 (removed 168) transitions.
[2025-06-01 19:39:01] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2025-06-01 19:39:01] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:39:01] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-01 19:39:01] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2025-06-01 19:39:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:39:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-01 19:39:02] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:39:02] [INFO ] Redundant transitions in 3 ms returned []
Running 238 sub problems to find dead transitions.
[2025-06-01 19:39:02] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2025-06-01 19:39:02] [INFO ] Invariant cache hit.
[2025-06-01 19:39:02] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 140 constraints, problems are : Problem set: 0 solved, 238 unsolved in 11980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 238/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:39:21] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 379 constraints, problems are : Problem set: 0 solved, 238 unsolved in 27647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39760ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 39761ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/165 places, 240/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40548 ms. Remains : 99/165 places, 240/408 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-10
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-10 finished in 40659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p1&&X(p2)))))||p0)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 408/408 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 390
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 157 transition count 386
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 151 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 151 transition count 374
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 146 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 146 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 141 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 141 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 136 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 136 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 131 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 131 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 121 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 121 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 116 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 114 transition count 278
Applied a total of 106 rules in 19 ms. Remains 114 /165 variables (removed 51) and now considering 278/408 (removed 130) transitions.
[2025-06-01 19:39:42] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
// Phase 1: matrix 188 rows 114 cols
[2025-06-01 19:39:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:39:42] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-01 19:39:42] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
[2025-06-01 19:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:39:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 19:39:42] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-01 19:39:42] [INFO ] Flow matrix only has 188 transitions (discarded 90 similar events)
[2025-06-01 19:39:42] [INFO ] Invariant cache hit.
[2025-06-01 19:39:42] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 188/302 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 159 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13869 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 188/302 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 276/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 435 constraints, problems are : Problem set: 0 solved, 276 unsolved in 26056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40070ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 40072ms
Starting structural reductions in LTL mode, iteration 1 : 114/165 places, 278/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40718 ms. Remains : 114/165 places, 278/408 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 41683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/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, 408/408 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 147 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 147 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 140 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 140 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 133 transition count 312
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 133 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 127 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 127 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 121 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 121 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 103 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 102 transition count 246
Applied a total of 130 rules in 26 ms. Remains 102 /165 variables (removed 63) and now considering 246/408 (removed 162) transitions.
[2025-06-01 19:40:23] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 102 cols
[2025-06-01 19:40:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:40:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 19:40:24] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2025-06-01 19:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:40:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 19:40:24] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2025-06-01 19:40:24] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2025-06-01 19:40:24] [INFO ] Invariant cache hit.
[2025-06-01 19:40:24] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
All remaining problems are real, not stopping.
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 11926 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 23661 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 35708ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 35709ms
Starting structural reductions in LTL mode, iteration 1 : 102/165 places, 246/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36325 ms. Remains : 102/165 places, 246/408 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-13
Stuttering criterion allowed to conclude after 317 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-13 finished in 36418 ms.
All properties solved by simple procedures.
Total runtime 530996 ms.

BK_STOP 1748806860371

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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-5832"
echo " Executing tool itstools"
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 r100-smll-174867007400108"
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.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 ;