Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700267.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 PolyORBLF-COL-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748903594939

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 22:33:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:33:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:33:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 22:33:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 22:33:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 697 ms
[2025-06-02 22:33:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 22:33:17] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 14 ms.
[2025-06-02 22:33:17] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (19 resets) in 1410 ms. (28 steps per ms) remains 12/29 properties
BEST_FIRST walk for 40003 steps (11 resets) in 334 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (12 resets) in 195 ms. (204 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (13 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 639 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (13 resets) in 255 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (13 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (13 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
[2025-06-02 22:33:18] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 22:33:18] [INFO ] Computed 26 invariants in 13 ms
[2025-06-02 22:33:18] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 37/54 variables, 7/8 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 2/11 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 7 (OVERLAPS) 23/79 variables, 14/25 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 8 solved, 4 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/51 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 3/10 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/79 variables, 15/25 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:19] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 13 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 3/116 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 10 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 10 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 80 transition count 57
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 72 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 62 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 61 transition count 46
Applied a total of 39 rules in 40 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
Running 45 sub problems to find dead transitions.
[2025-06-02 22:33:19] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2025-06-02 22:33:19] [INFO ] Computed 25 invariants in 2 ms
[2025-06-02 22:33:19] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:20] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:21] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:21] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 45/106 variables, 61/97 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 105 constraints, problems are : Problem set: 2 solved, 43 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 9/33 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/36 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 3/39 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 45/106 variables, 61/100 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 43/151 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:23] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 152 constraints, problems are : Problem set: 2 solved, 43 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/45 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4725ms problems are : Problem set: 2 solved, 43 unsolved
Search for dead transitions found 2 dead transitions in 4726ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/81 places, 44/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 42
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 58 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 58 /61 variables (removed 3) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4784 ms. Remains : 58/81 places, 40/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40001 steps (40 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (21 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16650 states, properties seen :0
Probabilistic random walk after 44415 steps, saw 16650 distinct states, run finished after 88 ms. (steps per millisecond=504 ) properties seen :0
Explored full state space saw : 16650 states, properties seen :0
Exhaustive walk after 44415 steps, saw 16650 distinct states, run finished after 66 ms. (steps per millisecond=672 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 22:33:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-02 22:33:24] [INFO ] Flatten gal took : 28 ms
[2025-06-02 22:33:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 22:33:24] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 22:33:24] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 25 ms.
[2025-06-02 22:33:24] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 173 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 470 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 470 transition count 818
Applied a total of 12 rules in 31 ms. Remains 470 /476 variables (removed 6) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:33:24] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 470 cols
[2025-06-02 22:33:25] [INFO ] Computed 46 invariants in 36 ms
[2025-06-02 22:33:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:32] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:32] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:32] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:32] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:32] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:32] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:33] [INFO ] Deduced a trap composed of 127 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:37] [INFO ] Deduced a trap composed of 205 places in 294 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:37] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:40] [INFO ] Deduced a trap composed of 223 places in 240 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:40] [INFO ] Deduced a trap composed of 223 places in 266 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:41] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:41] [INFO ] Deduced a trap composed of 235 places in 265 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:42] [INFO ] Deduced a trap composed of 248 places in 269 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:43] [INFO ] Deduced a trap composed of 248 places in 257 ms of which 70 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1276 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/470 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1276 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/470 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40684ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40689ms
[2025-06-02 22:34:05] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:34:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:34:06] [INFO ] Implicit Places using invariants in 484 ms returned [368, 369, 370, 371, 372, 373]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 493 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/476 places, 818/824 transitions.
Applied a total of 0 rules in 8 ms. Remains 464 /464 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41227 ms. Remains : 464/476 places, 818/824 transitions.
Support contains 173 out of 464 places after structural reductions.
[2025-06-02 22:34:06] [INFO ] Flatten gal took : 69 ms
[2025-06-02 22:34:06] [INFO ] Flatten gal took : 64 ms
[2025-06-02 22:34:06] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 40000 steps (11 resets) in 688 ms. (58 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (11 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2025-06-02 22:34:06] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 464 cols
[2025-06-02 22:34:06] [INFO ] Computed 40 invariants in 17 ms
[2025-06-02 22:34:06] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 3 (OVERLAPS) 272/452 variables, 25/29 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/458 variables, 6/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/462 variables, 4/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 806/1268 variables, 462/501 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1268 variables, 72/573 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1268 variables, 0/573 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1270 variables, 2/575 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1270 variables, 1/576 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1270 variables, 0/576 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1270 variables, 0/576 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1270/1270 variables, and 576 constraints, problems are : Problem set: 2 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 464/464 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 139/147 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/179 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/452 variables, 25/29 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:08] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:08] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:08] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 3/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/458 variables, 6/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/462 variables, 4/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 806/1268 variables, 462/504 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1268/1270 variables, and 576 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1676 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 462/464 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2654ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 86 place count 420 transition count 728
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 182 place count 372 transition count 728
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 266 place count 330 transition count 686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 272 place count 324 transition count 680
Iterating global reduction 2 with 6 rules applied. Total rules applied 278 place count 324 transition count 680
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 290 place count 324 transition count 668
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 302 place count 312 transition count 668
Applied a total of 302 rules in 95 ms. Remains 312 /464 variables (removed 152) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2025-06-02 22:34:09] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2025-06-02 22:34:09] [INFO ] Computed 38 invariants in 32 ms
[2025-06-02 22:34:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:15] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:15] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:15] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:15] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:15] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:16] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:16] [INFO ] Deduced a trap composed of 109 places in 184 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:16] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:17] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:18] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:19] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:19] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:21] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 49 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:39] [INFO ] Deduced a trap composed of 109 places in 185 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:42] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:45] [INFO ] Deduced a trap composed of 115 places in 205 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:46] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 53 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40482ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 40484ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40581 ms. Remains : 312/464 places, 668/818 transitions.
RANDOM walk for 40000 steps (17 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (19 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 424878 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 424878 steps, saw 195565 distinct states, run finished after 3004 ms. (steps per millisecond=141 ) properties seen :0
[2025-06-02 22:34:53] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:34:53] [INFO ] Invariant cache hit.
[2025-06-02 22:34:53] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/252 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/308 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/310 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 656/966 variables, 310/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 72/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/968 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/968 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/968 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/968 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 968/968 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/252 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/308 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:53] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:54] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:54] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:54] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:54] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 39 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/310 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 656/966 variables, 310/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/966 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/968 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/968 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/968 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/968 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 968/968 variables, and 428 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2631 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 8 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 312/312 places, 668/668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2025-06-02 22:34:56] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:34:57] [INFO ] Implicit Places using invariants in 832 ms returned []
[2025-06-02 22:34:57] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:34:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:35:00] [INFO ] Implicit Places using invariants and state equation in 3555 ms returned []
Implicit Place search using SMT with State Equation took 4402 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:35:00] [INFO ] Redundant transitions in 31 ms returned []
Running 666 sub problems to find dead transitions.
[2025-06-02 22:35:00] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:35:00] [INFO ] Invariant cache hit.
[2025-06-02 22:35:00] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:06] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:06] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:06] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:06] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:06] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:07] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:07] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:07] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:07] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:08] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:08] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:08] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:08] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:08] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:11] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:11] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:13] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:13] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:17] [INFO ] Deduced a trap composed of 178 places in 155 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:20] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 56 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:35:43] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 57 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64870 ms. Remains : 312/312 places, 668/668 transitions.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(((p0||X(F((p0&&X(F(p0)))))) U G(p1)))'
Support contains 7 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 456 transition count 812
Applied a total of 14 rules in 24 ms. Remains 456 /464 variables (removed 8) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:36:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 22:36:01] [INFO ] Computed 38 invariants in 24 ms
[2025-06-02 22:36:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:07] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:07] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:07] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:08] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:08] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:08] [INFO ] Deduced a trap composed of 217 places in 265 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:08] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:09] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:09] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:09] [INFO ] Deduced a trap composed of 194 places in 256 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:09] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:10] [INFO ] Deduced a trap composed of 222 places in 291 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:14] [INFO ] Deduced a trap composed of 205 places in 244 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:14] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:16] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:17] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:30] [INFO ] Deduced a trap composed of 298 places in 262 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:34] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:36] [INFO ] Deduced a trap composed of 234 places in 190 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40572ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40574ms
[2025-06-02 22:36:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:36:42] [INFO ] Implicit Places using invariants in 565 ms returned []
[2025-06-02 22:36:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:36:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:36:48] [INFO ] Implicit Places using invariants and state equation in 5329 ms returned []
Implicit Place search using SMT with State Equation took 5944 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:36:48] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:36:48] [INFO ] Invariant cache hit.
[2025-06-02 22:36:48] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:55] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:55] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:55] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:55] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:56] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:56] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:58] [INFO ] Deduced a trap composed of 205 places in 257 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:58] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:01] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:04] [INFO ] Deduced a trap composed of 194 places in 253 ms of which 70 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:05] [INFO ] Deduced a trap composed of 86 places in 228 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:05] [INFO ] Deduced a trap composed of 121 places in 244 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:06] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:12] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:13] [INFO ] Deduced a trap composed of 234 places in 204 ms of which 59 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 9.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 4.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)timeout

(s420 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:30] [INFO ] Deduced a trap composed of 298 places in 226 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:36] [INFO ] Deduced a trap composed of 222 places in 238 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:37] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106893 ms. Remains : 456/464 places, 812/818 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p0), false, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-03
Stuttering criterion allowed to conclude after 26058 steps with 7616 reset in 204 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-03 finished in 107517 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)&&(p1||X(G(p1))))||G((G((p1||X(G(p1))))||(F(p0)&&(p1||X(G(p1))))))))'
Support contains 33 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 456 transition count 812
Applied a total of 14 rules in 20 ms. Remains 456 /464 variables (removed 8) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:37:49] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 22:37:49] [INFO ] Computed 38 invariants in 13 ms
[2025-06-02 22:37:49] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:54] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:55] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:55] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:55] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:55] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:55] [INFO ] Deduced a trap composed of 217 places in 251 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:55] [INFO ] Deduced a trap composed of 121 places in 193 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:56] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:56] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:56] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:57] [INFO ] Deduced a trap composed of 222 places in 266 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:57] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:57] [INFO ] Deduced a trap composed of 205 places in 235 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:57] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:58] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:58] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:58] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:03] [INFO ] Deduced a trap composed of 222 places in 223 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:04] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:05] [INFO ] Deduced a trap composed of 234 places in 187 ms of which 53 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40370ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40373ms
[2025-06-02 22:38:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:38:29] [INFO ] Implicit Places using invariants in 506 ms returned []
[2025-06-02 22:38:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:38:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:38:35] [INFO ] Implicit Places using invariants and state equation in 5133 ms returned []
Implicit Place search using SMT with State Equation took 5671 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:38:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:38:35] [INFO ] Invariant cache hit.
[2025-06-02 22:38:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 217 places in 243 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:41] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:42] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:42] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:42] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:43] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:43] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:43] [INFO ] Deduced a trap composed of 205 places in 215 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:43] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:44] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:44] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:44] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:49] [INFO ] Deduced a trap composed of 222 places in 246 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 60344ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106424 ms. Remains : 456/464 places, 812/818 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-04 finished in 106677 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 10 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 264 place count 330 transition count 686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 324 transition count 680
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 79 ms. Remains 324 /464 variables (removed 140) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2025-06-02 22:39:35] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2025-06-02 22:39:35] [INFO ] Computed 38 invariants in 9 ms
[2025-06-02 22:39:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:41] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:41] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:44] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:44] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:52] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 49 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:07] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:13] [INFO ] Deduced a trap composed of 121 places in 184 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 51 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40325ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40327ms
[2025-06-02 22:40:16] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:40:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:40:16] [INFO ] Implicit Places using invariants in 835 ms returned []
[2025-06-02 22:40:16] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:40:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:40:19] [INFO ] Implicit Places using invariants and state equation in 2924 ms returned []
Implicit Place search using SMT with State Equation took 3778 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:40:19] [INFO ] Redundant transitions in 8 ms returned []
Running 678 sub problems to find dead transitions.
[2025-06-02 22:40:19] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:40:19] [INFO ] Invariant cache hit.
[2025-06-02 22:40:19] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:24] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:24] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:24] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:24] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:24] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:24] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:25] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:25] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:25] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:29] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:32] [INFO ] Deduced a trap composed of 190 places in 196 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:43] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:43] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:49] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 50 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:54] [INFO ] Deduced a trap composed of 121 places in 198 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:40:54] [INFO ] Deduced a trap composed of 126 places in 196 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/464 places, 680/818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104594 ms. Remains : 324/464 places, 680/818 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-06
Product exploration explored 100000 steps with 47 reset in 320 ms.
Product exploration explored 100000 steps with 68 reset in 415 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (23 resets) in 226 ms. (176 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2025-06-02 22:41:21] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:41:21] [INFO ] Invariant cache hit.
[2025-06-02 22:41:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/152 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/155 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/321 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/322 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 668/990 variables, 322/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 72/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/992 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/992 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/992 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/992 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/152 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/155 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/321 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:22] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:22] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:22] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 668/990 variables, 322/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 72/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/992 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/992 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:23] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 15 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/992 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/992 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1804 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2250ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 680/680 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 324 transition count 668
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 312 transition count 668
Applied a total of 24 rules in 35 ms. Remains 312 /324 variables (removed 12) and now considering 668/680 (removed 12) transitions.
Running 666 sub problems to find dead transitions.
[2025-06-02 22:41:23] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2025-06-02 22:41:23] [INFO ] Computed 38 invariants in 6 ms
[2025-06-02 22:41:23] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:29] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:29] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:29] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:29] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:29] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:30] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:30] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:30] [INFO ] Deduced a trap composed of 114 places in 187 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:31] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:32] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:33] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:33] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:35] [INFO ] Deduced a trap composed of 114 places in 182 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 49 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:52] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:56] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:59] [INFO ] Deduced a trap composed of 115 places in 195 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:59] [INFO ] Deduced a trap composed of 120 places in 216 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 53 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40392ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 40394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40444 ms. Remains : 312/324 places, 668/680 transitions.
RANDOM walk for 40000 steps (24 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (13 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 412735 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 412735 steps, saw 190291 distinct states, run finished after 3003 ms. (steps per millisecond=137 ) properties seen :0
[2025-06-02 22:42:07] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:42:07] [INFO ] Invariant cache hit.
[2025-06-02 22:42:07] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/252 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/308 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/310 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 656/966 variables, 310/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 72/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/968 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/968 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/968 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/968 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 968/968 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/252 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/308 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:08] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:08] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:08] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:08] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:08] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 39 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/310 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 656/966 variables, 310/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/966 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/968 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/968 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:10] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:10] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 32 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/968 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/968 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/968 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 968/968 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2669 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3107ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 8 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 668/668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2025-06-02 22:42:10] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:42:11] [INFO ] Implicit Places using invariants in 827 ms returned []
[2025-06-02 22:42:11] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:42:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:42:14] [INFO ] Implicit Places using invariants and state equation in 3475 ms returned []
Implicit Place search using SMT with State Equation took 4305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:42:14] [INFO ] Redundant transitions in 6 ms returned []
Running 666 sub problems to find dead transitions.
[2025-06-02 22:42:14] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:42:14] [INFO ] Invariant cache hit.
[2025-06-02 22:42:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:20] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:20] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:20] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:20] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:20] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:21] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:21] [INFO ] Deduced a trap composed of 109 places in 165 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:21] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:21] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:22] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:22] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:22] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:22] [INFO ] Deduced a trap composed of 120 places in 174 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:22] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:25] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:25] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:27] [INFO ] Deduced a trap composed of 109 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:27] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:31] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:34] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 56 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:57] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 57 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64756 ms. Remains : 312/312 places, 668/668 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
[2025-06-02 22:43:15] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2025-06-02 22:43:15] [INFO ] Computed 38 invariants in 13 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:43:15] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2025-06-02 22:43:16] [INFO ] [Real]Absence check using 12 positive and 26 generalized place invariants in 432 ms returned sat
[2025-06-02 22:43:19] [INFO ] [Real]Absence check using state equation in 2770 ms returned sat
[2025-06-02 22:43:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:43:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 32 ms returned sat
[2025-06-02 22:43:19] [INFO ] [Nat]Absence check using 12 positive and 26 generalized place invariants in 229 ms returned sat
[2025-06-02 22:43:22] [INFO ] [Nat]Absence check using state equation in 2511 ms returned sat
[2025-06-02 22:43:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:43:22] [INFO ] [Nat]Added 72 Read/Feed constraints in 200 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:22] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:22] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:23] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:23] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 38 ms to minimize.
[2025-06-02 22:43:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1149 ms
[2025-06-02 22:43:23] [INFO ] Computed and/alt/rep : 366/1569/360 causal constraints (skipped 306 transitions) in 45 ms.
[2025-06-02 22:43:28] [INFO ] Added : 155 causal constraints over 31 iterations in 4528 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 680/680 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Running 678 sub problems to find dead transitions.
[2025-06-02 22:43:28] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:43:28] [INFO ] Invariant cache hit.
[2025-06-02 22:43:28] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:32] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:33] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:33] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:37] [INFO ] Deduced a trap composed of 120 places in 148 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:40] [INFO ] Deduced a trap composed of 190 places in 181 ms of which 46 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7.0)
(s1 3.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 (/ 1.0 3.0))
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 (/ 1.0 3.0))
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 (/ 1.0 3.0))
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 47 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:01] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 48 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40319ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40321ms
[2025-06-02 22:44:08] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:44:09] [INFO ] Implicit Places using invariants in 813 ms returned []
[2025-06-02 22:44:09] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:44:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:44:12] [INFO ] Implicit Places using invariants and state equation in 2872 ms returned []
Implicit Place search using SMT with State Equation took 3706 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:44:12] [INFO ] Redundant transitions in 4 ms returned []
Running 678 sub problems to find dead transitions.
[2025-06-02 22:44:12] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:44:12] [INFO ] Invariant cache hit.
[2025-06-02 22:44:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:16] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:16] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:16] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:16] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:16] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:16] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:17] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:17] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:17] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:21] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:24] [INFO ] Deduced a trap composed of 190 places in 218 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:36] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:36] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:42] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 14 ms to minimize.
SMT process timed out in 30336ms, After SMT, problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 30337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74390 ms. Remains : 324/324 places, 680/680 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (21 resets) in 213 ms. (186 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2025-06-02 22:44:42] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:44:42] [INFO ] Invariant cache hit.
[2025-06-02 22:44:42] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/152 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/155 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/321 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/322 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 668/990 variables, 322/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/990 variables, 72/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/992 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/992 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/992 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/992 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/152 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/155 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/321 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:43] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:43] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:43] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 668/990 variables, 322/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/990 variables, 72/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/990 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/992 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/992 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:44] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 15 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/992 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/992 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 324/324 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 680/680 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 324 transition count 668
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 312 transition count 668
Applied a total of 24 rules in 20 ms. Remains 312 /324 variables (removed 12) and now considering 668/680 (removed 12) transitions.
Running 666 sub problems to find dead transitions.
[2025-06-02 22:44:45] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2025-06-02 22:44:45] [INFO ] Computed 38 invariants in 7 ms
[2025-06-02 22:44:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:51] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:51] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:51] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:51] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:51] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:51] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:52] [INFO ] Deduced a trap composed of 109 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:52] [INFO ] Deduced a trap composed of 114 places in 197 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:52] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:53] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:55] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:55] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:57] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 49 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:14] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:18] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:20] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:21] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 53 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40480ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 40481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40503 ms. Remains : 312/324 places, 668/680 transitions.
RANDOM walk for 40000 steps (32 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (16 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 385446 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 385446 steps, saw 177845 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2025-06-02 22:45:28] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:45:28] [INFO ] Invariant cache hit.
[2025-06-02 22:45:28] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/252 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/308 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/310 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 656/966 variables, 310/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 72/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/968 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/968 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/968 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/968 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 968/968 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/252 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/308 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:29] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:29] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:29] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:30] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:30] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 38 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/310 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 656/966 variables, 310/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/966 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/968 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/968 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:31] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:31] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 32 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/968 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/968 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/968 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 968/968 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 8 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 668/668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2025-06-02 22:45:31] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:45:32] [INFO ] Implicit Places using invariants in 895 ms returned []
[2025-06-02 22:45:32] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:45:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:45:36] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 4444 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:45:36] [INFO ] Redundant transitions in 3 ms returned []
Running 666 sub problems to find dead transitions.
[2025-06-02 22:45:36] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:45:36] [INFO ] Invariant cache hit.
[2025-06-02 22:45:36] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:42] [INFO ] Deduced a trap composed of 109 places in 181 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:43] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:43] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:43] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:43] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:43] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:43] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:44] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:46] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:47] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:48] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:49] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:53] [INFO ] Deduced a trap composed of 178 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:45:55] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 56 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:19] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 57 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60600ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65062 ms. Remains : 312/312 places, 668/668 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
[2025-06-02 22:46:37] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2025-06-02 22:46:37] [INFO ] Computed 38 invariants in 16 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:46:37] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2025-06-02 22:46:38] [INFO ] [Real]Absence check using 12 positive and 26 generalized place invariants in 425 ms returned sat
[2025-06-02 22:46:40] [INFO ] [Real]Absence check using state equation in 2720 ms returned sat
[2025-06-02 22:46:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:46:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 30 ms returned sat
[2025-06-02 22:46:41] [INFO ] [Nat]Absence check using 12 positive and 26 generalized place invariants in 224 ms returned sat
[2025-06-02 22:46:43] [INFO ] [Nat]Absence check using state equation in 2469 ms returned sat
[2025-06-02 22:46:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:46:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 197 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:44] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:44] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:44] [INFO ] Deduced a trap composed of 113 places in 189 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:44] [INFO ] Deduced a trap composed of 115 places in 180 ms of which 37 ms to minimize.
[2025-06-02 22:46:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1124 ms
[2025-06-02 22:46:45] [INFO ] Computed and/alt/rep : 366/1569/360 causal constraints (skipped 306 transitions) in 59 ms.
[2025-06-02 22:46:49] [INFO ] Added : 155 causal constraints over 31 iterations in 4449 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 70 reset in 277 ms.
Product exploration explored 100000 steps with 57 reset in 361 ms.
Built C files in :
/tmp/ltsmin4088747195684170461
[2025-06-02 22:46:50] [INFO ] Computing symmetric may disable matrix : 680 transitions.
[2025-06-02 22:46:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:46:50] [INFO ] Computing symmetric may enable matrix : 680 transitions.
[2025-06-02 22:46:50] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:46:50] [INFO ] Computing Do-Not-Accords matrix : 680 transitions.
[2025-06-02 22:46:50] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:46:50] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4088747195684170461
Running compilation step : cd /tmp/ltsmin4088747195684170461;'/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 1959 ms.
Running link step : cd /tmp/ltsmin4088747195684170461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4088747195684170461;'/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/stateBased4296460979738251759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 680/680 transitions.
Applied a total of 0 rules in 17 ms. Remains 324 /324 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Running 678 sub problems to find dead transitions.
[2025-06-02 22:47:05] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:47:05] [INFO ] Invariant cache hit.
[2025-06-02 22:47:05] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:09] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:09] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:09] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:10] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:10] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:10] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:10] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:10] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:11] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:15] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:17] [INFO ] Deduced a trap composed of 190 places in 172 ms of which 48 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s205 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 47 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:38] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 48 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40375ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40377ms
[2025-06-02 22:47:45] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:47:46] [INFO ] Implicit Places using invariants in 846 ms returned []
[2025-06-02 22:47:46] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:47:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:47:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:47:49] [INFO ] Implicit Places using invariants and state equation in 2993 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:47:49] [INFO ] Redundant transitions in 3 ms returned []
Running 678 sub problems to find dead transitions.
[2025-06-02 22:47:49] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:47:49] [INFO ] Invariant cache hit.
[2025-06-02 22:47:49] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:54] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:55] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:59] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:48:02] [INFO ] Deduced a trap composed of 190 places in 183 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:48:13] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:48:14] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 49 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:48:25] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:48:25] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:48:42] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 57 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 104600 ms. Remains : 324/324 places, 680/680 transitions.
Built C files in :
/tmp/ltsmin9913662287578977325
[2025-06-02 22:48:50] [INFO ] Computing symmetric may disable matrix : 680 transitions.
[2025-06-02 22:48:50] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:48:50] [INFO ] Computing symmetric may enable matrix : 680 transitions.
[2025-06-02 22:48:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:48:50] [INFO ] Computing Do-Not-Accords matrix : 680 transitions.
[2025-06-02 22:48:50] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:48:50] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9913662287578977325
Running compilation step : cd /tmp/ltsmin9913662287578977325;'/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 1835 ms.
Running link step : cd /tmp/ltsmin9913662287578977325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9913662287578977325;'/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/stateBased4170065595275763151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 22:49:05] [INFO ] Flatten gal took : 52 ms
[2025-06-02 22:49:05] [INFO ] Flatten gal took : 36 ms
[2025-06-02 22:49:05] [INFO ] Time to serialize gal into /tmp/LTL8661767249413747212.gal : 6 ms
[2025-06-02 22:49:05] [INFO ] Time to serialize properties into /tmp/LTL4598675556683880619.prop : 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/LTL8661767249413747212.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3327306937550526853.hoa' '-atoms' '/tmp/LTL4598675556683880619.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...317
Loading property file /tmp/LTL4598675556683880619.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3327306937550526853.hoa
Detected timeout of ITS tools.
[2025-06-02 22:49:20] [INFO ] Flatten gal took : 36 ms
[2025-06-02 22:49:20] [INFO ] Flatten gal took : 42 ms
[2025-06-02 22:49:20] [INFO ] Time to serialize gal into /tmp/LTL12398367937857000211.gal : 7 ms
[2025-06-02 22:49:20] [INFO ] Time to serialize properties into /tmp/LTL12612212986764768505.ltl : 8 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/LTL12398367937857000211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12612212986764768505.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("((BlockedTasks>=3)||(SigAbort>=1))"))&&(G("((((P_1160_0+P_1160_1)+(P_1160_2+P_1160_3))+(P_1160_4+P_1160_5))<=(PlaceSources_0+Pl...174
Formula 0 simplified : G!"((BlockedTasks>=3)||(SigAbort>=1))" | F!"((((P_1160_0+P_1160_1)+(P_1160_2+P_1160_3))+(P_1160_4+P_1160_5))<=(PlaceSources_0+PlaceS...166
Detected timeout of ITS tools.
[2025-06-02 22:49:35] [INFO ] Flatten gal took : 33 ms
[2025-06-02 22:49:35] [INFO ] Applying decomposition
[2025-06-02 22:49:35] [INFO ] Flatten gal took : 27 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/graph10278985349373040283.txt' '-o' '/tmp/graph10278985349373040283.bin' '-w' '/tmp/graph10278985349373040283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10278985349373040283.bin' '-l' '-1' '-v' '-w' '/tmp/graph10278985349373040283.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:49:35] [INFO ] Decomposing Gal with order
[2025-06-02 22:49:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:49:36] [INFO ] Removed a total of 495 redundant transitions.
[2025-06-02 22:49:36] [INFO ] Flatten gal took : 307 ms
[2025-06-02 22:49:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 61 ms.
[2025-06-02 22:49:36] [INFO ] Time to serialize gal into /tmp/LTL6088749363454781358.gal : 20 ms
[2025-06-02 22:49:36] [INFO ] Time to serialize properties into /tmp/LTL7553245817410783658.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/LTL6088749363454781358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7553245817410783658.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...275
Read 1 LTL properties
Checking formula 0 : !(((F("((gi0.gi0.gu38.BlockedTasks>=3)||(gi0.gi0.gu38.SigAbort>=1))"))&&(G("((((gu26.P_1160_0+gu26.P_1160_1)+(gu26.P_1160_2+gu26.P_116...240
Formula 0 simplified : G!"((gi0.gi0.gu38.BlockedTasks>=3)||(gi0.gi0.gu38.SigAbort>=1))" | F!"((((gu26.P_1160_0+gu26.P_1160_1)+(gu26.P_1160_2+gu26.P_1160_3)...232
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-06 finished in 615991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 44 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 456 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 456 transition count 812
Applied a total of 14 rules in 19 ms. Remains 456 /464 variables (removed 8) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:49:51] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 22:49:51] [INFO ] Computed 38 invariants in 7 ms
[2025-06-02 22:49:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:58] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:58] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:58] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:58] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:58] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:58] [INFO ] Deduced a trap composed of 217 places in 261 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:59] [INFO ] Deduced a trap composed of 86 places in 264 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:59] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:59] [INFO ] Deduced a trap composed of 121 places in 204 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:59] [INFO ] Deduced a trap composed of 194 places in 240 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:00] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:00] [INFO ] Deduced a trap composed of 222 places in 266 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:04] [INFO ] Deduced a trap composed of 205 places in 247 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:05] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:07] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:07] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:20] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:25] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:26] [INFO ] Deduced a trap composed of 234 places in 166 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40426ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40427ms
[2025-06-02 22:50:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:50:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:50:32] [INFO ] Implicit Places using invariants in 543 ms returned []
[2025-06-02 22:50:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:50:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:50:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:50:37] [INFO ] Implicit Places using invariants and state equation in 4741 ms returned []
Implicit Place search using SMT with State Equation took 5305 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:50:37] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:50:37] [INFO ] Invariant cache hit.
[2025-06-02 22:50:37] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:44] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:44] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:44] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:44] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:45] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:45] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:48] [INFO ] Deduced a trap composed of 205 places in 314 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:48] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:51] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:54] [INFO ] Deduced a trap composed of 194 places in 245 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:55] [INFO ] Deduced a trap composed of 86 places in 237 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:55] [INFO ] Deduced a trap composed of 121 places in 225 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:56] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:03] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:04] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 60 ms to minimize.
(s445 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 (/ 1.0 3.0))
(s156 0.0)
(s157 (/ 1.0 3.0))
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 (/ 2.0 3.0))
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 (/ 2.0 3.0))
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 10.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 2.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:19] [INFO ] Deduced a trap composed of 298 places in 237 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:26] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:27] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106130 ms. Remains : 456/464 places, 812/818 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-08 finished in 107186 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 8 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 264 place count 330 transition count 686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 324 transition count 680
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 32 ms. Remains 324 /464 variables (removed 140) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2025-06-02 22:51:38] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2025-06-02 22:51:39] [INFO ] Computed 38 invariants in 14 ms
[2025-06-02 22:51:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:43] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:43] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:43] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:43] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:43] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:43] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:44] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:44] [INFO ] Deduced a trap composed of 115 places in 187 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:44] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:45] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:48] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:55] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 49 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:10] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:16] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 51 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40562ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40571ms
[2025-06-02 22:52:19] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:52:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:52:20] [INFO ] Implicit Places using invariants in 872 ms returned []
[2025-06-02 22:52:20] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:52:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:52:23] [INFO ] Implicit Places using invariants and state equation in 3169 ms returned []
Implicit Place search using SMT with State Equation took 4043 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:52:23] [INFO ] Redundant transitions in 7 ms returned []
Running 678 sub problems to find dead transitions.
[2025-06-02 22:52:23] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:52:23] [INFO ] Invariant cache hit.
[2025-06-02 22:52:23] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:27] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:27] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:28] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:28] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:28] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:28] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:28] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:28] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:29] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:33] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:36] [INFO ] Deduced a trap composed of 190 places in 164 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:47] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:47] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:53] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 50 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:58] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:58] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/464 places, 680/818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105028 ms. Remains : 324/464 places, 680/818 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 1125 steps with 0 reset in 10 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-10 finished in 105118 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 6 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 818
Applied a total of 2 rules in 10 ms. Remains 462 /464 variables (removed 2) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:53:24] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2025-06-02 22:53:24] [INFO ] Computed 38 invariants in 12 ms
[2025-06-02 22:53:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:30] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:30] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:30] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:30] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:30] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:30] [INFO ] Deduced a trap composed of 217 places in 263 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:31] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:31] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:32] [INFO ] Deduced a trap composed of 223 places in 287 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:33] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:36] [INFO ] Deduced a trap composed of 205 places in 257 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:36] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:39] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:39] [INFO ] Deduced a trap composed of 235 places in 232 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:39] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:40] [INFO ] Deduced a trap composed of 127 places in 230 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:42] [INFO ] Deduced a trap composed of 248 places in 247 ms of which 56 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 53 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 53 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40403ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40404ms
[2025-06-02 22:54:04] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:54:04] [INFO ] Implicit Places using invariants in 483 ms returned []
[2025-06-02 22:54:04] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:54:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:54:09] [INFO ] Implicit Places using invariants and state equation in 4679 ms returned []
Implicit Place search using SMT with State Equation took 5163 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:54:09] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:54:09] [INFO ] Invariant cache hit.
[2025-06-02 22:54:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:15] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:15] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:15] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:15] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:15] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:16] [INFO ] Deduced a trap composed of 217 places in 245 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:16] [INFO ] Deduced a trap composed of 127 places in 209 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:16] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:17] [INFO ] Deduced a trap composed of 200 places in 218 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:17] [INFO ] Deduced a trap composed of 223 places in 284 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:17] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:18] [INFO ] Deduced a trap composed of 205 places in 226 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:18] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:18] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:18] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:19] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:24] [INFO ] Deduced a trap composed of 223 places in 218 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:25] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:25] [INFO ] Deduced a trap composed of 235 places in 235 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:26] [INFO ] Deduced a trap composed of 248 places in 210 ms of which 57 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:34] [INFO ] Deduced a trap composed of 92 places in 202 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Starting structural reductions in LTL mode, iteration 1 : 462/464 places, 818/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105959 ms. Remains : 462/464 places, 818/818 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-12 finished in 106729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 818/818 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Applied a total of 300 rules in 43 ms. Remains 312 /464 variables (removed 152) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2025-06-02 22:55:10] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2025-06-02 22:55:10] [INFO ] Computed 38 invariants in 7 ms
[2025-06-02 22:55:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:17] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:17] [INFO ] Deduced a trap composed of 114 places in 194 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:17] [INFO ] Deduced a trap composed of 103 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:17] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:18] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:23] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:23] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:23] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:26] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 50 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:43] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:43] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:51] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 53 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40454ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 40456ms
[2025-06-02 22:55:51] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:55:51] [INFO ] Implicit Places using invariants in 683 ms returned []
[2025-06-02 22:55:51] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:55:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:55:55] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 3803 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:55:55] [INFO ] Redundant transitions in 4 ms returned []
Running 666 sub problems to find dead transitions.
[2025-06-02 22:55:55] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:55:55] [INFO ] Invariant cache hit.
[2025-06-02 22:55:55] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:01] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:01] [INFO ] Deduced a trap composed of 114 places in 196 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:01] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:02] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:07] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:07] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:08] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:12] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:12] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:13] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 52 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:33] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
SMT process timed out in 60358ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/464 places, 668/818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104677 ms. Remains : 312/464 places, 668/818 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLCardinality-14
Product exploration explored 100000 steps with 1662 reset in 275 ms.
Product exploration explored 100000 steps with 1638 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 99 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Running 666 sub problems to find dead transitions.
[2025-06-02 22:56:56] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:56:56] [INFO ] Invariant cache hit.
[2025-06-02 22:56:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:02] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:02] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:02] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:02] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:02] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:03] [INFO ] Deduced a trap composed of 109 places in 205 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:03] [INFO ] Deduced a trap composed of 114 places in 193 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:03] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:04] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:09] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:09] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:10] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:14] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:14] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:15] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 51 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:24] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 52 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40372ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 40373ms
[2025-06-02 22:57:36] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:57:37] [INFO ] Implicit Places using invariants in 708 ms returned []
[2025-06-02 22:57:37] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:57:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:57:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:57:40] [INFO ] Implicit Places using invariants and state equation in 3061 ms returned []
Implicit Place search using SMT with State Equation took 3810 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:57:40] [INFO ] Redundant transitions in 4 ms returned []
Running 666 sub problems to find dead transitions.
[2025-06-02 22:57:40] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 22:57:40] [INFO ] Invariant cache hit.
[2025-06-02 22:57:40] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 109 places in 192 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:46] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:47] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:48] [INFO ] Deduced a trap composed of 178 places in 153 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:52] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:52] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:53] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:57] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:57] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:58] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/52 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 52 constraints, problems are : Problem set: 36 solved, 630 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/51 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:28] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:30] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:30] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 3/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 54 constraints, problems are : Problem set: 36 solved, 630 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 60374ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 312/312 places, 632/668 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:58:41] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 104609 ms. Remains : 312/312 places, 632/668 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 107 steps (0 resets) in 5 ms. (17 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 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1621 reset in 239 ms.
Product exploration explored 100000 steps with 1658 reset in 269 ms.
Built C files in :
/tmp/ltsmin14666552261281923225
[2025-06-02 22:58:42] [INFO ] Computing symmetric may disable matrix : 632 transitions.
[2025-06-02 22:58:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:58:42] [INFO ] Computing symmetric may enable matrix : 632 transitions.
[2025-06-02 22:58:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:58:42] [INFO ] Computing Do-Not-Accords matrix : 632 transitions.
[2025-06-02 22:58:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:58:42] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14666552261281923225
Running compilation step : cd /tmp/ltsmin14666552261281923225;'/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 1596 ms.
Running link step : cd /tmp/ltsmin14666552261281923225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14666552261281923225;'/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/stateBased6042584594168204678.hoa' '--buchi-type=spotba'
LTSmin run took 6470 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T06-LTLCardinality-14 finished in 219459 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)))'
[2025-06-02 22:58:50] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5337489587829342759
[2025-06-02 22:58:50] [INFO ] Computing symmetric may disable matrix : 818 transitions.
[2025-06-02 22:58:50] [INFO ] Applying decomposition
[2025-06-02 22:58:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:58:50] [INFO ] Computing symmetric may enable matrix : 818 transitions.
[2025-06-02 22:58:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:58:50] [INFO ] Flatten gal took : 30 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/graph8747220010747985891.txt' '-o' '/tmp/graph8747220010747985891.bin' '-w' '/tmp/graph8747220010747985891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8747220010747985891.bin' '-l' '-1' '-v' '-w' '/tmp/graph8747220010747985891.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:58:50] [INFO ] Decomposing Gal with order
[2025-06-02 22:58:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:58:50] [INFO ] Removed a total of 688 redundant transitions.
[2025-06-02 22:58:50] [INFO ] Flatten gal took : 90 ms
[2025-06-02 22:58:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 11 ms.
[2025-06-02 22:58:50] [INFO ] Computing Do-Not-Accords matrix : 818 transitions.
[2025-06-02 22:58:50] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:58:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality16361206484940489544.gal : 6 ms
[2025-06-02 22:58:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality7478612439142691345.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/LTLCardinality16361206484940489544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7478612439142691345.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
[2025-06-02 22:58:50] [INFO ] Built C files in 405ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5337489587829342759
Running compilation step : cd /tmp/ltsmin5337489587829342759;'/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'
Checking formula 0 : !(((F("((gi0.gi1.gi8.gu18.BlockedTasks>=3)||(gi0.gi1.gi8.gu18.SigAbort>=1))"))&&(G("((((gu69.P_1160_0+gu69.P_1160_1)+(gu69.P_1160_2+gu...248
Formula 0 simplified : G!"((gi0.gi1.gi8.gu18.BlockedTasks>=3)||(gi0.gi1.gi8.gu18.SigAbort>=1))" | F!"((((gu69.P_1160_0+gu69.P_1160_1)+(gu69.P_1160_2+gu69.P...240
Compilation finished in 2329 ms.
Running link step : cd /tmp/ltsmin5337489587829342759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5337489587829342759;'/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))&&[]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-02 23:27:22] [INFO ] Applying decomposition
[2025-06-02 23:27:23] [INFO ] Flatten gal took : 104 ms
[2025-06-02 23:27:23] [INFO ] Decomposing Gal with order
[2025-06-02 23:27:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:27:23] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-02 23:27:23] [INFO ] Flatten gal took : 81 ms
[2025-06-02 23:27:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality11216905221629495318.gal : 13 ms
[2025-06-02 23:27:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality15318629734371076078.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/LTLCardinality11216905221629495318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15318629734371076078.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...299
Read 1 LTL properties
Checking formula 0 : !(((F("((BlockedTasks>=3)||(SigAbort>=1))"))&&(G("((((P_1160_0+P_1160_1)+(P_1160_2+P_1160_3))+(P_1160_4+P_1160_5))<=(PlaceSources_0+Pl...174
Formula 0 simplified : G!"((BlockedTasks>=3)||(SigAbort>=1))" | F!"((((P_1160_0+P_1160_1)+(P_1160_2+P_1160_3))+(P_1160_4+P_1160_5))<=(PlaceSources_0+PlaceS...166
LTSmin run took 2032209 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3569539 ms.

BK_STOP 1748907165728

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="LTLCardinality"
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 PolyORBLF-COL-S02J04T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253700267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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