Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400100.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-b064, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 25K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K 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-b064-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748795382962

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-b064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 16:29:45] [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 16:29:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:29:46] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2025-06-01 16:29:46] [INFO ] Transformed 306 places.
[2025-06-01 16:29:46] [INFO ] Transformed 840 transitions.
[2025-06-01 16:29:46] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA FunctionPointer-PT-b064-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 524
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 524
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 100 place count 188 transition count 482
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 114 place count 174 transition count 454
Iterating global reduction 2 with 14 rules applied. Total rules applied 128 place count 174 transition count 454
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 140 place count 174 transition count 442
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 146 place count 168 transition count 430
Iterating global reduction 3 with 6 rules applied. Total rules applied 152 place count 168 transition count 430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 164 transition count 414
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 164 transition count 414
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 164 place count 160 transition count 406
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 160 transition count 406
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 158 transition count 398
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 158 transition count 398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 157 transition count 394
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 157 transition count 394
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 156 transition count 392
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 156 transition count 392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 155 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 155 transition count 390
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 154 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 154 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 153 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 153 transition count 386
Applied a total of 182 rules in 240 ms. Remains 153 /222 variables (removed 69) and now considering 386/648 (removed 262) transitions.
[2025-06-01 16:29:46] [INFO ] Flow matrix only has 264 transitions (discarded 122 similar events)
// Phase 1: matrix 264 rows 153 cols
[2025-06-01 16:29:46] [INFO ] Computed 2 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:29:47] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-06-01 16:29:47] [INFO ] Flow matrix only has 264 transitions (discarded 122 similar events)
[2025-06-01 16:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:29:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-01 16:29:48] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-06-01 16:29:48] [INFO ] Flow matrix only has 264 transitions (discarded 122 similar events)
[2025-06-01 16:29:48] [INFO ] Invariant cache hit.
[2025-06-01 16:29:48] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (OVERLAPS) 264/417 variables, 153/155 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 57/212 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 384 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/417 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 384 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 212 constraints, problems are : Problem set: 0 solved, 384 unsolved in 24406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (OVERLAPS) 264/417 variables, 153/155 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 57/212 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 384/596 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:30:39] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 597 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55338ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 55370ms
Starting structural reductions in LTL mode, iteration 1 : 153/222 places, 386/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57309 ms. Remains : 153/222 places, 386/648 transitions.
Support contains 21 out of 153 places after structural reductions.
[2025-06-01 16:30:44] [INFO ] Flatten gal took : 122 ms
[2025-06-01 16:30:44] [INFO ] Flatten gal took : 60 ms
[2025-06-01 16:30:44] [INFO ] Input system was already deterministic with 386 transitions.
RANDOM walk for 40076 steps (30 resets) in 1137 ms. (35 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
[2025-06-01 16:30:45] [INFO ] Flow matrix only has 264 transitions (discarded 122 similar events)
[2025-06-01 16:30:45] [INFO ] Invariant cache hit.
[2025-06-01 16:30:45] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 167/218 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 365/417 variables, and 160 constraints, problems are : Problem set: 1 solved, 0 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 119/153 constraints, ReadFeed: 40/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(!p0) U X(X(p1)))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 360
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 360
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 145 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 140 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 140 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 135 transition count 328
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 130 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 130 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 125 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 112 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 108 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 107 transition count 262
Applied a total of 96 rules in 37 ms. Remains 107 /153 variables (removed 46) and now considering 262/386 (removed 124) transitions.
[2025-06-01 16:30:45] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2025-06-01 16:30:45] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:30:45] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-01 16:30:45] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2025-06-01 16:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:30:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 16:30:46] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-06-01 16:30:46] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2025-06-01 16:30:46] [INFO ] Invariant cache hit.
[2025-06-01 16:30:46] [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, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 260 unsolved in 12050 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: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 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, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 260/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:31:06] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 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: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42264ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 42270ms
Starting structural reductions in LTL mode, iteration 1 : 107/153 places, 262/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43044 ms. Remains : 107/153 places, 262/386 transitions.
Stuttering acceptance computed with spot in 553 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-02
Stuttering criterion allowed to conclude after 437 steps with 3 reset in 21 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-02 finished in 43721 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(G(p0))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 358
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 358
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 144 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 137 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 137 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 131 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 131 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 125 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 125 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 119 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 119 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 113 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 113 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 108 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 108 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 103 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 103 transition count 248
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 98 transition count 238
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 97 transition count 236
Applied a total of 118 rules in 48 ms. Remains 97 /153 variables (removed 56) and now considering 236/386 (removed 150) transitions.
[2025-06-01 16:31:29] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2025-06-01 16:31:29] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:31:29] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-01 16:31:29] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2025-06-01 16:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:31:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 16:31:29] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-06-01 16:31:29] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2025-06-01 16:31:29] [INFO ] Invariant cache hit.
[2025-06-01 16:31:29] [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, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, 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/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 23442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33735ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 33736ms
Starting structural reductions in LTL mode, iteration 1 : 97/153 places, 236/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34253 ms. Remains : 97/153 places, 236/386 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-03 finished in 34474 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 362
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 139 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 139 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 134 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 134 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 129 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 129 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 111 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 107 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 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 104 place count 106 transition count 256
Applied a total of 104 rules in 141 ms. Remains 106 /153 variables (removed 47) and now considering 256/386 (removed 130) transitions.
[2025-06-01 16:32:03] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2025-06-01 16:32:03] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:32:04] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-01 16:32:04] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 16:32:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:32:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:32:04] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:32:04] [INFO ] Redundant transitions in 15 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 16:32:04] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 16:32:04] [INFO ] Invariant cache hit.
[2025-06-01 16:32:04] [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 12113 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
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 23950 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]
After SMT, in 36194ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 36195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/153 places, 256/386 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37130 ms. Remains : 106/153 places, 256/386 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-04
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-04 finished in 37208 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((p0||G(p1))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 358
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 358
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 144 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 137 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 137 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 131 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 131 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 125 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 125 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 119 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 119 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 113 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 113 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 108 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 108 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 103 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 103 transition count 248
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 98 transition count 238
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 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 120 place count 97 transition count 234
Applied a total of 120 rules in 79 ms. Remains 97 /153 variables (removed 56) and now considering 234/386 (removed 152) transitions.
[2025-06-01 16:32:40] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2025-06-01 16:32:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:32:41] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-01 16:32:41] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2025-06-01 16:32:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:32:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 16:32:41] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:32:41] [INFO ] Redundant transitions in 6 ms returned []
Running 232 sub problems to find dead transitions.
[2025-06-01 16:32:41] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2025-06-01 16:32:41] [INFO ] Invariant cache hit.
[2025-06-01 16:32:41] [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 9635 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 16:32:58] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:32:59] [INFO ] Deduced a trap along path composed of 3 places in 20 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 30008 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 39759ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 39761ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/153 places, 234/386 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40456 ms. Remains : 97/153 places, 234/386 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-05
Product exploration explored 100000 steps with 1294 reset in 715 ms.
Stack based approach found an accepted trace after 2350 steps with 28 reset with depth 32 and stack size 32 in 11 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-05 finished in 41260 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(p0))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 362
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 145 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 139 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 139 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 134 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 134 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 129 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 129 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 124 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 124 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 111 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 111 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 107 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 106 transition count 254
Applied a total of 106 rules in 42 ms. Remains 106 /153 variables (removed 47) and now considering 254/386 (removed 132) transitions.
[2025-06-01 16:33:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2025-06-01 16:33:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:33:22] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-01 16:33:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2025-06-01 16:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:33:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:33:22] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:33:22] [INFO ] Redundant transitions in 3 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-01 16:33:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2025-06-01 16:33:22] [INFO ] Invariant cache hit.
[2025-06-01 16:33:22] [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, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 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, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 21432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33733ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 33734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/153 places, 254/386 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34320 ms. Remains : 106/153 places, 254/386 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-06
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-06 finished in 34375 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 360
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 360
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 145 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 139 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 139 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 134 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 134 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 129 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 129 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 111 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 107 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 107 transition count 262
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 102 place count 107 transition count 258
Applied a total of 102 rules in 42 ms. Remains 107 /153 variables (removed 46) and now considering 258/386 (removed 128) transitions.
[2025-06-01 16:33:56] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2025-06-01 16:33:56] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:33:56] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-01 16:33:56] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:33:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:33:57] [INFO ] Implicit Places using invariants and state equation in 493 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 16:33:57] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2025-06-01 16:33:57] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:33:57] [INFO ] Invariant cache hit.
[2025-06-01 16:33:57] [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/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 10613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 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, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34509ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 34511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/153 places, 258/386 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35268 ms. Remains : 107/153 places, 258/386 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-07
Product exploration explored 100000 steps with 1007 reset in 771 ms.
Product exploration explored 100000 steps with 994 reset in 438 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 11934 steps (7 resets) in 54 ms. (216 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2025-06-01 16:34:33] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:34:33] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 16:34:33] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:34:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:34:34] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:34:34] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
[2025-06-01 16:34:34] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:34:34] [INFO ] Invariant cache hit.
[2025-06-01 16:34:34] [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/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12618 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 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, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 25933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38696ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 38698ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39398 ms. Remains : 107/107 places, 258/258 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 18480 steps (18 resets) in 56 ms. (324 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1004 reset in 512 ms.
Product exploration explored 100000 steps with 1012 reset in 633 ms.
Built C files in :
/tmp/ltsmin7544524007229143053
[2025-06-01 16:35:14] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2025-06-01 16:35:14] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:35:14] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2025-06-01 16:35:14] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:35:14] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2025-06-01 16:35:14] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:35:14] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7544524007229143053
Running compilation step : cd /tmp/ltsmin7544524007229143053;'/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 1580 ms.
Running link step : cd /tmp/ltsmin7544524007229143053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin7544524007229143053;'/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/stateBased1611317656601596353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2025-06-01 16:35:29] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:35:29] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-01 16:35:29] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:35:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:35:30] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:35:30] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2025-06-01 16:35:30] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 16:35:30] [INFO ] Invariant cache hit.
[2025-06-01 16:35:30] [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/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 11893 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 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, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 21170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33140ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 33141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33636 ms. Remains : 107/107 places, 258/258 transitions.
Built C files in :
/tmp/ltsmin7309234191999048783
[2025-06-01 16:36:03] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2025-06-01 16:36:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:36:03] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2025-06-01 16:36:03] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:36:03] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2025-06-01 16:36:03] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:36:03] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7309234191999048783
Running compilation step : cd /tmp/ltsmin7309234191999048783;'/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 959 ms.
Running link step : cd /tmp/ltsmin7309234191999048783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7309234191999048783;'/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/stateBased14645486953181027290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 16:36:18] [INFO ] Flatten gal took : 19 ms
[2025-06-01 16:36:18] [INFO ] Flatten gal took : 19 ms
[2025-06-01 16:36:18] [INFO ] Time to serialize gal into /tmp/LTL7326438887534450624.gal : 5 ms
[2025-06-01 16:36:18] [INFO ] Time to serialize properties into /tmp/LTL13882276243330500753.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7326438887534450624.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3200117218223641223.hoa' '-atoms' '/tmp/LTL13882276243330500753.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13882276243330500753.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3200117218223641223.hoa
Detected timeout of ITS tools.
[2025-06-01 16:36:33] [INFO ] Flatten gal took : 38 ms
[2025-06-01 16:36:33] [INFO ] Flatten gal took : 30 ms
[2025-06-01 16:36:33] [INFO ] Time to serialize gal into /tmp/LTL13854271452512693199.gal : 7 ms
[2025-06-01 16:36:33] [INFO ] Time to serialize properties into /tmp/LTL8081413734538394486.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13854271452512693199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8081413734538394486.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((s0<1)||(l240<1))"))))
Formula 0 simplified : GF!"((s0<1)||(l240<1))"
Detected timeout of ITS tools.
[2025-06-01 16:36:48] [INFO ] Flatten gal took : 17 ms
[2025-06-01 16:36:48] [INFO ] Applying decomposition
[2025-06-01 16:36:48] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17528922586942029869.txt' '-o' '/tmp/graph17528922586942029869.bin' '-w' '/tmp/graph17528922586942029869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17528922586942029869.bin' '-l' '-1' '-v' '-w' '/tmp/graph17528922586942029869.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:36:48] [INFO ] Decomposing Gal with order
[2025-06-01 16:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:36:49] [INFO ] Removed a total of 432 redundant transitions.
[2025-06-01 16:36:49] [INFO ] Flatten gal took : 87 ms
[2025-06-01 16:36:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 24 ms.
[2025-06-01 16:36:49] [INFO ] Time to serialize gal into /tmp/LTL5077725834069289182.gal : 9 ms
[2025-06-01 16:36:49] [INFO ] Time to serialize properties into /tmp/LTL5805565499962652174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5077725834069289182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5805565499962652174.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i9.u1.s0<1)||(i12.u30.l240<1))"))))
Formula 0 simplified : GF!"((i9.u1.s0<1)||(i12.u30.l240<1))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b064-LTLFireability-07 finished in 187627 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' '!((p0 U G(!p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 358
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 358
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 144 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 137 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 137 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 131 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 131 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 125 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 125 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 119 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 119 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 113 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 113 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 108 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 108 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 103 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 103 transition count 248
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 98 transition count 238
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 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 120 place count 97 transition count 234
Applied a total of 120 rules in 32 ms. Remains 97 /153 variables (removed 56) and now considering 234/386 (removed 152) transitions.
[2025-06-01 16:37:04] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2025-06-01 16:37:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:37:04] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-01 16:37:04] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2025-06-01 16:37:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:37:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 16:37:04] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:37:04] [INFO ] Redundant transitions in 0 ms returned []
Running 232 sub problems to find dead transitions.
[2025-06-01 16:37:04] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2025-06-01 16:37:04] [INFO ] Invariant cache hit.
[2025-06-01 16:37:04] [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 10369 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 16:37:23] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:37:24] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 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 30015 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 40473ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 40474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/153 places, 234/386 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40896 ms. Remains : 97/153 places, 234/386 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, true, p0]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-08
Entered a terminal (fully accepting) state of product in 279 steps with 3 reset in 2 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-08 finished in 41025 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) U p1)) U G((!p2&&F(!p3)))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 364
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 146 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 135 transition count 328
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 130 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 130 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 125 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 108 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 108 transition count 260
Applied a total of 100 rules in 49 ms. Remains 108 /153 variables (removed 45) and now considering 260/386 (removed 126) transitions.
[2025-06-01 16:37:45] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2025-06-01 16:37:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:37:45] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-01 16:37:45] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 16:37:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:37:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 16:37:45] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:37:45] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 16:37:45] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 16:37:45] [INFO ] Invariant cache hit.
[2025-06-01 16:37:45] [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, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 152 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13500 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: 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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 410 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30010 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: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43650ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43651ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/153 places, 260/386 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44296 ms. Remains : 108/153 places, 260/386 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p2)), (AND (NOT p0) p3), p3]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-09
Product exploration explored 100000 steps with 33355 reset in 362 ms.
Product exploration explored 100000 steps with 33283 reset in 398 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 p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 162 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter insensitive) to 7 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p1 p2)), (AND (NOT p0) p3), p3]
RANDOM walk for 40000 steps (37 resets) in 203 ms. (196 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
[2025-06-01 16:38:31] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 16:38:31] [INFO ] Invariant cache hit.
[2025-06-01 16:38:31] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 254/285 variables, and 87 constraints, problems are : Problem set: 1 solved, 0 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 86/108 constraints, ReadFeed: 1/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (OR p0 (NOT p3)))), (F p3), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 29 factoid took 728 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), p3]
Stuttering acceptance computed with spot in 281 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), p3]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 16:38:32] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 16:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:32] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-01 16:38:32] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 16:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 16:38:33] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:38:33] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 16:38:33] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2025-06-01 16:38:33] [INFO ] Invariant cache hit.
[2025-06-01 16:38:33] [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, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 152 constraints, problems are : Problem set: 0 solved, 258 unsolved in 10277 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: 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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 410 constraints, problems are : Problem set: 0 solved, 258 unsolved in 26424 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: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36889ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 36892ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37558 ms. Remains : 108/108 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 120 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), p3]
RANDOM walk for 36130 steps (30 resets) in 81 ms. (440 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p3), (F p1), (F p0), (F (NOT (OR p2 (NOT p3))))]
Knowledge based reduction with 21 factoid took 422 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), p3]
Stuttering acceptance computed with spot in 195 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), p3]
Stuttering acceptance computed with spot in 194 ms :[(OR p3 p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), p3]
Stuttering criterion allowed to conclude after 2515 steps with 28 reset in 9 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-09 finished in 86530 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(X(p0))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 362
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 139 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 139 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 134 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 134 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 129 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 129 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 124 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 124 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 119 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 119 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 114 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 114 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 109 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 109 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 104 transition count 252
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 103 transition count 250
Applied a total of 106 rules in 18 ms. Remains 103 /153 variables (removed 50) and now considering 250/386 (removed 136) transitions.
[2025-06-01 16:39:11] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2025-06-01 16:39:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:11] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-01 16:39:11] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2025-06-01 16:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:39:12] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-01 16:39:12] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2025-06-01 16:39:12] [INFO ] Invariant cache hit.
[2025-06-01 16:39:12] [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/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 170/273 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 145 constraints, problems are : Problem set: 0 solved, 248 unsolved in 8718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 170/273 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 248/393 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 393 constraints, problems are : Problem set: 0 solved, 248 unsolved in 19594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28410ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 28411ms
Starting structural reductions in LTL mode, iteration 1 : 103/153 places, 250/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28949 ms. Remains : 103/153 places, 250/386 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-11 finished in 29188 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(p0))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 360
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 360
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 145 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 138 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 138 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 132 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 132 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 120 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 120 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 114 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 114 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 109 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 109 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 104 transition count 252
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 104 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 99 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 98 transition count 240
Applied a total of 114 rules in 15 ms. Remains 98 /153 variables (removed 55) and now considering 240/386 (removed 146) transitions.
[2025-06-01 16:39:40] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2025-06-01 16:39:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:41] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-01 16:39:41] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 16:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 16:39:41] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-01 16:39:41] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 16:39:41] [INFO ] Invariant cache hit.
[2025-06-01 16:39:41] [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/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 7894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 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/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 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 16:39:57] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:57] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 377 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37984ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 37985ms
Starting structural reductions in LTL mode, iteration 1 : 98/153 places, 240/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38452 ms. Remains : 98/153 places, 240/386 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-14 finished in 38581 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(G(p0))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 386/386 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 362
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 139 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 139 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 134 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 134 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 129 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 129 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 111 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 107 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 106 transition count 260
Applied a total of 100 rules in 27 ms. Remains 106 /153 variables (removed 47) and now considering 260/386 (removed 126) transitions.
[2025-06-01 16:40:19] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2025-06-01 16:40:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:19] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-01 16:40:19] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2025-06-01 16:40:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 16:40:20] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-01 16:40:20] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2025-06-01 16:40:20] [INFO ] Invariant cache hit.
[2025-06-01 16:40:20] [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, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 258 unsolved in 12124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, 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/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 406 constraints, problems are : Problem set: 0 solved, 258 unsolved in 25710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37975ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 37976ms
Starting structural reductions in LTL mode, iteration 1 : 106/153 places, 260/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38774 ms. Remains : 106/153 places, 260/386 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-15 finished in 38925 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)))'
[2025-06-01 16:40:58] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16182934588206199477
[2025-06-01 16:40:58] [INFO ] Computing symmetric may disable matrix : 386 transitions.
[2025-06-01 16:40:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:40:58] [INFO ] Applying decomposition
[2025-06-01 16:40:58] [INFO ] Computing symmetric may enable matrix : 386 transitions.
[2025-06-01 16:40:58] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:40:58] [INFO ] Flatten gal took : 37 ms
[2025-06-01 16:40:58] [INFO ] Computing Do-Not-Accords matrix : 386 transitions.
[2025-06-01 16:40:58] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:40:58] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16182934588206199477
Running compilation step : cd /tmp/ltsmin16182934588206199477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2822869509852737329.txt' '-o' '/tmp/graph2822869509852737329.bin' '-w' '/tmp/graph2822869509852737329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2822869509852737329.bin' '-l' '-1' '-v' '-w' '/tmp/graph2822869509852737329.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:40:59] [INFO ] Decomposing Gal with order
[2025-06-01 16:40:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:40:59] [INFO ] Removed a total of 651 redundant transitions.
[2025-06-01 16:40:59] [INFO ] Flatten gal took : 73 ms
[2025-06-01 16:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 31 ms.
[2025-06-01 16:40:59] [INFO ] Time to serialize gal into /tmp/LTLFireability15599105742162960523.gal : 8 ms
[2025-06-01 16:40:59] [INFO ] Time to serialize properties into /tmp/LTLFireability3837288437272328592.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15599105742162960523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3837288437272328592.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.u1.s0<1)||(i11.u42.l240<1))"))))
Formula 0 simplified : GF!"((i1.u1.s0<1)||(i11.u42.l240<1))"
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin16182934588206199477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16182934588206199477;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: Initializing POR dependencies: labels 387, guards 386
pins2lts-mc-linux64( 5/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 1.166: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 1.167: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 1.167: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.404: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.417: There are 388 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.417: State length is 154, there are 390 groups
pins2lts-mc-linux64( 0/ 8), 1.417: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.417: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.417: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.417: Visible groups: 0 / 390, labels: 1 / 388
pins2lts-mc-linux64( 0/ 8), 1.417: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.417: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.612: [Blue] ~120 levels ~960 states ~6784 transitions
pins2lts-mc-linux64( 1/ 8), 1.751: [Blue] ~240 levels ~1920 states ~10432 transitions
pins2lts-mc-linux64( 1/ 8), 2.165: [Blue] ~480 levels ~3840 states ~20992 transitions
pins2lts-mc-linux64( 6/ 8), 2.652: [Blue] ~960 levels ~7680 states ~51400 transitions
pins2lts-mc-linux64( 6/ 8), 3.435: [Blue] ~1920 levels ~15360 states ~97480 transitions
pins2lts-mc-linux64( 6/ 8), 4.610: [Blue] ~3840 levels ~30720 states ~189640 transitions
pins2lts-mc-linux64( 6/ 8), 6.519: [Blue] ~7680 levels ~61440 states ~373960 transitions
pins2lts-mc-linux64( 6/ 8), 9.432: [Blue] ~15360 levels ~122880 states ~742600 transitions
pins2lts-mc-linux64( 6/ 8), 14.590: [Blue] ~30720 levels ~245760 states ~1479880 transitions
pins2lts-mc-linux64( 6/ 8), 23.646: [Blue] ~61440 levels ~491520 states ~2954440 transitions
pins2lts-mc-linux64( 6/ 8), 41.785: [Blue] ~122880 levels ~983040 states ~5903560 transitions
pins2lts-mc-linux64( 6/ 8), 77.163: [Blue] ~245760 levels ~1966080 states ~11801800 transitions
pins2lts-mc-linux64( 6/ 8), 148.785: [Blue] ~491520 levels ~3932160 states ~23598280 transitions
pins2lts-mc-linux64( 3/ 8), 276.009: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 276.263:
pins2lts-mc-linux64( 0/ 8), 276.263: Explored 5091634 states 28421326 transitions, fanout: 5.582
pins2lts-mc-linux64( 0/ 8), 276.263: Total exploration time 274.830 sec (274.620 sec minimum, 274.695 sec on average)
pins2lts-mc-linux64( 0/ 8), 276.263: States per second: 18526, Transitions per second: 103414
pins2lts-mc-linux64( 0/ 8), 276.263:
pins2lts-mc-linux64( 0/ 8), 276.263: State space has 28354611 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 276.263: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 276.263: blue states: 5091634 (17.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 276.263: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 276.263: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 276.263:
pins2lts-mc-linux64( 0/ 8), 276.263: Total memory used for local state coloring: 77.7MB
pins2lts-mc-linux64( 0/ 8), 276.263:
pins2lts-mc-linux64( 0/ 8), 276.263: Queue width: 8B, total height: 5091634, memory: 38.85MB
pins2lts-mc-linux64( 0/ 8), 276.263: Tree memory: 472.3MB, 17.5 B/state, compr.: 2.8%
pins2lts-mc-linux64( 0/ 8), 276.263: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 276.263: Stored 424 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 276.264: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 276.264: Est. total memory use: 511.2MB (~1062.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16182934588206199477;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16182934588206199477;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 17:04:43] [INFO ] Flatten gal took : 19 ms
[2025-06-01 17:04:43] [INFO ] Time to serialize gal into /tmp/LTLFireability16994126400659514499.gal : 4 ms
[2025-06-01 17:04:43] [INFO ] Time to serialize properties into /tmp/LTLFireability9044029806175903716.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16994126400659514499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9044029806175903716.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("((s0<1)||(l240<1))"))))
Formula 0 simplified : GF!"((s0<1)||(l240<1))"
Detected timeout of ITS tools.
[2025-06-01 17:28:30] [INFO ] Flatten gal took : 743 ms
[2025-06-01 17:28:31] [INFO ] Input system was already deterministic with 386 transitions.
[2025-06-01 17:28:32] [INFO ] Transformed 153 places.
[2025-06-01 17:28:32] [INFO ] Transformed 386 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 17:28:33] [INFO ] Time to serialize gal into /tmp/LTLFireability12649326690646312569.gal : 19 ms
[2025-06-01 17:28:33] [INFO ] Time to serialize properties into /tmp/LTLFireability6664688940842389022.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12649326690646312569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6664688940842389022.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((s0<1)||(l240<1))"))))
Formula 0 simplified : GF!"((s0<1)||(l240<1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
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-b064"
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-b064, 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-174867007400100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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