Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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-S02J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748914726442

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-03 01:38:47] [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-03 01:38:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:38:47] [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-03 01:38:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 01:38:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2025-06-03 01:38:48] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.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-03 01:38:48] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2025-06-03 01:38:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-12 FALSE 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 (21 resets) in 1340 ms. (29 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40001 steps (11 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (14 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (13 resets) in 117 ms. (338 steps per ms) remains 8/8 properties
[2025-06-03 01:38:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 01:38:50] [INFO ] Computed 26 invariants in 8 ms
[2025-06-03 01:38:50] [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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 34/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/50 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 5 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 4 solved, 4 unsolved in 411 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: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 5/8 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:50] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 4/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 7 solved, 1 unsolved in 665 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: 4/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1129ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 2 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 15 place count 73 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 33 place count 64 transition count 49
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 64 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 62 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 62 transition count 47
Applied a total of 38 rules in 33 ms. Remains 62 /81 variables (removed 19) and now considering 47/65 (removed 18) transitions.
Running 46 sub problems to find dead transitions.
[2025-06-03 01:38:51] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 62 cols
[2025-06-03 01:38:51] [INFO ] Computed 25 invariants in 2 ms
[2025-06-03 01:38:51] [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/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:51] [INFO ] Deduced a trap composed of 14 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-03 01:38:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:51] [INFO ] Deduced a trap composed of 14 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-03 01:38:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:51] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:52] [INFO ] Deduced a trap composed of 10 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-03 01:38:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:52] [INFO ] Deduced a trap composed of 19 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-03 01:38:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/36 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 46/108 variables, 62/98 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/108 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 106 constraints, problems are : Problem set: 2 solved, 44 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:38:53] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 46/108 variables, 62/99 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 8/107 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 44/151 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/108 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 151 constraints, problems are : Problem set: 2 solved, 44 unsolved in 2614 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/46 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4422ms problems are : Problem set: 2 solved, 44 unsolved
Search for dead transitions found 2 dead transitions in 4424ms
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 : 62/81 places, 45/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 58 transition count 41
Applied a total of 4 rules in 5 ms. Remains 58 /62 variables (removed 4) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4472 ms. Remains : 58/81 places, 41/65 transitions.
RANDOM walk for 40000 steps (35 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (25 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16254 states, properties seen :0
Probabilistic random walk after 43281 steps, saw 16254 distinct states, run finished after 98 ms. (steps per millisecond=441 ) properties seen :0
Explored full state space saw : 16254 states, properties seen :0
Exhaustive walk after 43281 steps, saw 16254 distinct states, run finished after 62 ms. (steps per millisecond=698 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 01:38:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-03 01:38:56] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 01:38:56] [INFO ] Flatten gal took : 8 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 01:38:56] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 26 ms.
[2025-06-03 01:38:56] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 194 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 28 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 01:38:56] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2025-06-03 01:38:56] [INFO ] Computed 48 invariants in 43 ms
[2025-06-03 01:38: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/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:05] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:05] [INFO ] Deduced a trap composed of 73 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-03 01:39:05] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:05] [INFO ] Deduced a trap composed of 73 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-03 01:39:06] [INFO ] Deduced a trap composed of 73 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-03 01:39:06] [INFO ] Deduced a trap composed of 245 places in 310 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:06] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:07] [INFO ] Deduced a trap composed of 133 places in 234 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:07] [INFO ] Deduced a trap composed of 278 places in 288 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:07] [INFO ] Deduced a trap composed of 278 places in 305 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:08] [INFO ] Deduced a trap composed of 251 places in 331 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:08] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:16] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:16] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:29] [INFO ] Deduced a trap composed of 253 places in 287 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:29] [INFO ] Deduced a trap composed of 349 places in 292 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:35] [INFO ] Deduced a trap composed of 259 places in 332 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:35] [INFO ] Deduced a trap composed of 247 places in 258 ms of which 72 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(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 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 9)
(s147 0)
(s148 1)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 7)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 3)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 6)
(s471 0)
(s472 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 64 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40809ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40815ms
[2025-06-03 01:39:37] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:39:37] [INFO ] Implicit Places using invariants in 558 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 565 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/536 places, 968/968 transitions.
Applied a total of 0 rules in 11 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41427 ms. Remains : 528/536 places, 968/968 transitions.
Support contains 194 out of 528 places after structural reductions.
[2025-06-03 01:39:37] [INFO ] Flatten gal took : 76 ms
[2025-06-03 01:39:37] [INFO ] Flatten gal took : 72 ms
[2025-06-03 01:39:38] [INFO ] Input system was already deterministic with 968 transitions.
RANDOM walk for 40000 steps (14 resets) in 258 ms. (154 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (13 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2025-06-03 01:39:38] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2025-06-03 01:39:38] [INFO ] Computed 42 invariants in 24 ms
[2025-06-03 01:39:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 367/374 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/413 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/525 variables, 16/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/526 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 956/1482 variables, 526/567 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 72/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1484 variables, 2/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1484 variables, 1/642 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1484 variables, 0/642 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1484 variables, 0/642 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 642 constraints, problems are : Problem set: 1 solved, 1 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 528/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/219 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/232 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 286/518 variables, 21/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:39] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:39] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:39] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 3/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/523 variables, 5/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/526 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 956/1482 variables, 526/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1482/1484 variables, and 642 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 526/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 408 transition count 848
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 408 transition count 848
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 336 place count 360 transition count 800
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 348 place count 360 transition count 788
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 348 transition count 788
Applied a total of 360 rules in 146 ms. Remains 348 /528 variables (removed 180) and now considering 788/968 (removed 180) transitions.
Running 786 sub problems to find dead transitions.
[2025-06-03 01:39:40] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
// Phase 1: matrix 776 rows 348 cols
[2025-06-03 01:39:40] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 01:39:40] [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/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:47] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:47] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:47] [INFO ] Deduced a trap composed of 44 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-03 01:39:47] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:47] [INFO ] Deduced a trap composed of 44 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-03 01:39:47] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:47] [INFO ] Deduced a trap composed of 119 places in 189 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:48] [INFO ] Deduced a trap composed of 124 places in 211 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:48] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:48] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:48] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:49] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:49] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:49] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:51] [INFO ] Deduced a trap composed of 204 places in 204 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:55] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:55] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:39:56] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1124 variables, and 58 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1124 variables, and 58 constraints, problems are : Problem set: 0 solved, 786 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/786 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40576ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 40579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40729 ms. Remains : 348/528 places, 788/968 transitions.
RANDOM walk for 40000 steps (23 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (13 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 379002 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 379002 steps, saw 180434 distinct states, run finished after 3004 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-03 01:40:24] [INFO ] Flow matrix only has 776 transitions (discarded 12 similar events)
[2025-06-03 01:40:24] [INFO ] Invariant cache hit.
[2025-06-03 01:40:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 49/155 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/169 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 169/338 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/343 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/346 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 776/1122 variables, 346/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 72/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/155 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/169 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 169/338 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:25] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:25] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/343 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/346 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 776/1122 variables, 346/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 72/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 1122/1124 variables, and 462 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 346/348 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2368ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 9 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' '!(X(G((p0&&X(p1)))))'
Support contains 27 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 30 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:40:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 01:40:27] [INFO ] Computed 42 invariants in 18 ms
[2025-06-03 01:40:27] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:36] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:36] [INFO ] Deduced a trap composed of 72 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-03 01:40:36] [INFO ] Deduced a trap composed of 72 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-03 01:40:36] [INFO ] Deduced a trap composed of 72 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-03 01:40:36] [INFO ] Deduced a trap composed of 72 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-03 01:40:37] [INFO ] Deduced a trap composed of 245 places in 254 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:37] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:37] [INFO ] Deduced a trap composed of 72 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-03 01:40:38] [INFO ] Deduced a trap composed of 266 places in 263 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:38] [INFO ] Deduced a trap composed of 250 places in 318 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:38] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:39] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:56] [INFO ] Deduced a trap composed of 241 places in 284 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:40:56] [INFO ] Deduced a trap composed of 348 places in 279 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:00] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:01] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40505ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40508ms
[2025-06-03 01:41:07] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:41:08] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-06-03 01:41:08] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:41:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:41:14] [INFO ] Implicit Places using invariants and state equation in 6190 ms returned []
Implicit Place search using SMT with State Equation took 6782 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:41:14] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:41:14] [INFO ] Invariant cache hit.
[2025-06-03 01:41: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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:23] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:23] [INFO ] Deduced a trap composed of 72 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-03 01:41:23] [INFO ] Deduced a trap composed of 72 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-03 01:41:23] [INFO ] Deduced a trap composed of 72 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-03 01:41:23] [INFO ] Deduced a trap composed of 72 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-03 01:41:24] [INFO ] Deduced a trap composed of 245 places in 275 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:24] [INFO ] Deduced a trap composed of 121 places in 219 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:24] [INFO ] Deduced a trap composed of 72 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-03 01:41:25] [INFO ] Deduced a trap composed of 250 places in 282 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:25] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:25] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:34] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:37] [INFO ] Deduced a trap composed of 218 places in 258 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:37] [INFO ] Deduced a trap composed of 266 places in 259 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 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 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:57] [INFO ] Deduced a trap composed of 246 places in 281 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:59] [INFO ] Deduced a trap composed of 86 places in 250 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:41:59] [INFO ] Deduced a trap composed of 284 places in 199 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:08] [INFO ] Deduced a trap composed of 241 places in 245 ms of which 63 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107740 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-01 finished in 108048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 20 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:42:15] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:42:15] [INFO ] Invariant cache hit.
[2025-06-03 01:42:15] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:24] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:24] [INFO ] Deduced a trap composed of 72 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-03 01:42:24] [INFO ] Deduced a trap composed of 72 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-03 01:42:24] [INFO ] Deduced a trap composed of 72 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-03 01:42:24] [INFO ] Deduced a trap composed of 72 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-03 01:42:24] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:25] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:25] [INFO ] Deduced a trap composed of 72 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-03 01:42:26] [INFO ] Deduced a trap composed of 250 places in 286 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:26] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:26] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:34] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:42:43] [INFO ] Deduced a trap composed of 218 places in 233 ms of which 58 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40394ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40396ms
[2025-06-03 01:42:55] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:42:56] [INFO ] Implicit Places using invariants in 721 ms returned []
[2025-06-03 01:42:56] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:42:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:43:02] [INFO ] Implicit Places using invariants and state equation in 6635 ms returned []
Implicit Place search using SMT with State Equation took 7360 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:43:03] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:43:03] [INFO ] Invariant cache hit.
[2025-06-03 01:43:03] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:12] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:12] [INFO ] Deduced a trap composed of 72 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-03 01:43:12] [INFO ] Deduced a trap composed of 72 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-03 01:43:12] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:12] [INFO ] Deduced a trap composed of 72 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-03 01:43:12] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:13] [INFO ] Deduced a trap composed of 121 places in 225 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:13] [INFO ] Deduced a trap composed of 72 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-03 01:43:13] [INFO ] Deduced a trap composed of 250 places in 286 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:14] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:14] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:22] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:25] [INFO ] Deduced a trap composed of 218 places in 242 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:25] [INFO ] Deduced a trap composed of 266 places in 249 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:45] [INFO ] Deduced a trap composed of 246 places in 267 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:47] [INFO ] Deduced a trap composed of 86 places in 234 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:47] [INFO ] Deduced a trap composed of 284 places in 201 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:43:56] [INFO ] Deduced a trap composed of 241 places in 245 ms of which 64 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108191 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 334 ms.
Product exploration explored 100000 steps with 20000 reset in 259 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:44:04] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:44:04] [INFO ] Invariant cache hit.
[2025-06-03 01:44:04] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:14] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:14] [INFO ] Deduced a trap composed of 72 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-03 01:44:14] [INFO ] Deduced a trap composed of 72 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-03 01:44:14] [INFO ] Deduced a trap composed of 72 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-03 01:44:14] [INFO ] Deduced a trap composed of 72 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-03 01:44:14] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:15] [INFO ] Deduced a trap composed of 121 places in 226 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:15] [INFO ] Deduced a trap composed of 72 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-03 01:44:16] [INFO ] Deduced a trap composed of 250 places in 292 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:16] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:16] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:24] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:44:33] [INFO ] Deduced a trap composed of 218 places in 241 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40421ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40423ms
[2025-06-03 01:44:45] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:44:46] [INFO ] Implicit Places using invariants in 728 ms returned []
[2025-06-03 01:44:46] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:44:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:44:52] [INFO ] Implicit Places using invariants and state equation in 6742 ms returned []
Implicit Place search using SMT with State Equation took 7476 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:44:52] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:44:52] [INFO ] Invariant cache hit.
[2025-06-03 01:44:52] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:02] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:02] [INFO ] Deduced a trap composed of 72 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-03 01:45:02] [INFO ] Deduced a trap composed of 72 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-03 01:45:02] [INFO ] Deduced a trap composed of 72 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-03 01:45:02] [INFO ] Deduced a trap composed of 72 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-03 01:45:02] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:03] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:03] [INFO ] Deduced a trap composed of 72 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-03 01:45:04] [INFO ] Deduced a trap composed of 250 places in 285 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:04] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:04] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:13] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:16] [INFO ] Deduced a trap composed of 218 places in 240 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:16] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:34] [INFO ] Deduced a trap composed of 246 places in 293 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:37] [INFO ] Deduced a trap composed of 86 places in 227 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:37] [INFO ] Deduced a trap composed of 284 places in 195 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:45:46] [INFO ] Deduced a trap composed of 241 places in 257 ms of which 64 ms to minimize.
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 Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 108324 ms. Remains : 516/516 places, 956/956 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 91 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 221 ms.
Product exploration explored 100000 steps with 20000 reset in 221 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 516 transition count 956
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 36 place count 516 transition count 1022
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 102 place count 516 transition count 1022
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 114 place count 504 transition count 1010
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 126 place count 504 transition count 1010
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 174 place count 504 transition count 1010
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 198 place count 480 transition count 986
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 222 place count 480 transition count 986
Deduced a syphon composed of 120 places in 1 ms
Applied a total of 222 rules in 86 ms. Remains 480 /516 variables (removed 36) and now considering 986/956 (removed -30) transitions.
Running 984 sub problems to find dead transitions.
[2025-06-03 01:45:55] [INFO ] Flow matrix only has 974 transitions (discarded 12 similar events)
// Phase 1: matrix 974 rows 480 cols
[2025-06-03 01:45:55] [INFO ] Computed 42 invariants in 16 ms
[2025-06-03 01:45:55] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 984 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 984 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:04] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:04] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:04] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:04] [INFO ] Deduced a trap composed of 46 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-03 01:46:04] [INFO ] Deduced a trap composed of 46 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-03 01:46:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:05] [INFO ] Deduced a trap composed of 125 places in 260 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:05] [INFO ] Deduced a trap composed of 130 places in 255 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:08] [INFO ] Deduced a trap composed of 216 places in 244 ms of which 57 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:14] [INFO ] Deduced a trap composed of 119 places in 238 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:14] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 20 ms to minimize.
Problem TDEAD884 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD892 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:15] [INFO ] Deduced a trap composed of 92 places in 209 ms of which 33 ms to minimize.
Problem TDEAD896 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD937 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1454 variables, and 52 constraints, problems are : Problem set: 164 solved, 820 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 984/984 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 164 solved, 820 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 11/11 constraints. Problems are: Problem set: 164 solved, 820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 11/22 constraints. Problems are: Problem set: 164 solved, 820 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 12/34 constraints. Problems are: Problem set: 164 solved, 820 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 1/35 constraints. Problems are: Problem set: 164 solved, 820 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/35 constraints. Problems are: Problem set: 164 solved, 820 unsolved
At refinement iteration 5 (OVERLAPS) 20/400 variables, 4/39 constraints. Problems are: Problem set: 164 solved, 820 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:33] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:33] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:34] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:34] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:34] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:34] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:34] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:34] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1454 variables, and 47 constraints, problems are : Problem set: 164 solved, 820 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 11/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/984 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40546ms problems are : Problem set: 164 solved, 820 unsolved
Search for dead transitions found 164 dead transitions in 40548ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 164 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:46:35] [INFO ] Redundant transitions in 53 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 480/516 places, 822/956 transitions.
Graph (complete) has 2304 edges and 480 vertex of which 382 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.4 ms
Discarding 98 places :
Also discarding 0 output transitions
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 1 rules in 22 ms. Remains 382 /480 variables (removed 98) and now considering 822/822 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 382/516 places, 822/956 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40718 ms. Remains : 382/516 places, 822/956 transitions.
Built C files in :
/tmp/ltsmin13585732503743169416
[2025-06-03 01:46:35] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13585732503743169416
Running compilation step : cd /tmp/ltsmin13585732503743169416;'/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 1769 ms.
Running link step : cd /tmp/ltsmin13585732503743169416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13585732503743169416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12702364422705401785.hoa' '--buchi-type=spotba'
LTSmin run took 301 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-03 finished in 262895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(X(p1) U (X(G(p1))||(p2&&X(p1))))))'
Support contains 20 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 9 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 01:46:38] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2025-06-03 01:46:38] [INFO ] Computed 42 invariants in 18 ms
[2025-06-03 01:46:38] [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/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:47] [INFO ] Deduced a trap composed of 74 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-03 01:46:47] [INFO ] Deduced a trap composed of 74 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-03 01:46:47] [INFO ] Deduced a trap composed of 74 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-03 01:46:47] [INFO ] Deduced a trap composed of 74 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-03 01:46:47] [INFO ] Deduced a trap composed of 74 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-03 01:46:48] [INFO ] Deduced a trap composed of 245 places in 286 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:48] [INFO ] Deduced a trap composed of 133 places in 241 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:48] [INFO ] Deduced a trap composed of 74 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-03 01:46:49] [INFO ] Deduced a trap composed of 251 places in 301 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:49] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:49] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:46:52] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 52 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:09] [INFO ] Deduced a trap composed of 278 places in 268 ms of which 93 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 53 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40447ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40449ms
[2025-06-03 01:47:18] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:47:19] [INFO ] Implicit Places using invariants in 599 ms returned []
[2025-06-03 01:47:19] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:47:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:47:26] [INFO ] Implicit Places using invariants and state equation in 7204 ms returned []
Implicit Place search using SMT with State Equation took 7805 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2025-06-03 01:47:26] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:47:26] [INFO ] Invariant cache hit.
[2025-06-03 01:47:26] [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/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:35] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:35] [INFO ] Deduced a trap composed of 74 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-03 01:47:35] [INFO ] Deduced a trap composed of 74 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-03 01:47:35] [INFO ] Deduced a trap composed of 74 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-03 01:47:35] [INFO ] Deduced a trap composed of 74 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-03 01:47:36] [INFO ] Deduced a trap composed of 245 places in 280 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:36] [INFO ] Deduced a trap composed of 133 places in 249 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:36] [INFO ] Deduced a trap composed of 74 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-03 01:47:37] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:37] [INFO ] Deduced a trap composed of 251 places in 286 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:37] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:38] [INFO ] Deduced a trap composed of 233 places in 255 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:46] [INFO ] Deduced a trap composed of 259 places in 283 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:47] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:48] [INFO ] Deduced a trap composed of 278 places in 277 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:47:48] [INFO ] Deduced a trap composed of 284 places in 223 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 56 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:04] [INFO ] Deduced a trap composed of 253 places in 305 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:05] [INFO ] Deduced a trap composed of 349 places in 301 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:09] [INFO ] Deduced a trap composed of 247 places in 248 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:10] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Finished structural reductions in LTL mode , in 1 iterations and 108696 ms. Remains : 528/528 places, 968/968 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 310 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 p0 p2), (X p2), (X (AND p2 p1)), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 29 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-04 finished in 109690 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((G(p1)||p0))))'
Support contains 27 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 486 transition count 926
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 84 place count 486 transition count 860
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 216 place count 420 transition count 860
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 414 transition count 854
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 414 transition count 854
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 312 place count 372 transition count 812
Applied a total of 312 rules in 39 ms. Remains 372 /528 variables (removed 156) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 01:48:27] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2025-06-03 01:48:27] [INFO ] Computed 42 invariants in 10 ms
[2025-06-03 01:48:27] [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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:34] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:34] [INFO ] Deduced a trap composed of 48 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-03 01:48:34] [INFO ] Deduced a trap composed of 48 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-03 01:48:34] [INFO ] Deduced a trap composed of 48 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-03 01:48:34] [INFO ] Deduced a trap composed of 48 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-03 01:48:34] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:34] [INFO ] Deduced a trap composed of 48 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-03 01:48:35] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:35] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:35] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:37] [INFO ] Deduced a trap composed of 222 places in 201 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:43] [INFO ] Deduced a trap composed of 104 places in 205 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:44] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:48:45] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 16 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 14/14 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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1172 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40435ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40437ms
[2025-06-03 01:49:08] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 01:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:49:09] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2025-06-03 01:49:09] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 01:49:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:49:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:49:12] [INFO ] Implicit Places using invariants and state equation in 3533 ms returned []
Implicit Place search using SMT with State Equation took 4571 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:49:12] [INFO ] Redundant transitions in 16 ms returned []
Running 810 sub problems to find dead transitions.
[2025-06-03 01:49:12] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 01:49:12] [INFO ] Invariant cache hit.
[2025-06-03 01:49: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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:19] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:19] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:19] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:19] [INFO ] Deduced a trap composed of 48 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-03 01:49:19] [INFO ] Deduced a trap composed of 48 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-03 01:49:20] [INFO ] Deduced a trap composed of 131 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-03 01:49:20] [INFO ] Deduced a trap composed of 136 places in 238 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:20] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:20] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:21] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:21] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:23] [INFO ] Deduced a trap composed of 222 places in 185 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:28] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:29] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 30397ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 30398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 372/528 places, 812/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75473 ms. Remains : 372/528 places, 812/968 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-07
Product exploration explored 100000 steps with 52 reset in 322 ms.
Product exploration explored 100000 steps with 64 reset in 417 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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (24 resets) in 336 ms. (118 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (22 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
[2025-06-03 01:49:44] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 01:49:44] [INFO ] Invariant cache hit.
[2025-06-03 01:49:44] [INFO ] State equation strengthened by 72 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/196 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 366/1172 variables, and 37 constraints, problems are : Problem set: 1 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 11 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-07 finished in 76753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(p0))||F((p1 U (p2||G(p1))))))))'
Support contains 21 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 528 transition count 932
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 492 transition count 926
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 486 transition count 926
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 486 transition count 860
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 420 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 414 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 414 transition count 854
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 300 place count 378 transition count 818
Applied a total of 300 rules in 40 ms. Remains 378 /528 variables (removed 150) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-03 01:49:44] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 378 cols
[2025-06-03 01:49:44] [INFO ] Computed 42 invariants in 8 ms
[2025-06-03 01:49:44] [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/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:51] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:51] [INFO ] Deduced a trap composed of 49 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-03 01:49:51] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:52] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:52] [INFO ] Deduced a trap composed of 49 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-03 01:49:52] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:52] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:52] [INFO ] Deduced a trap composed of 49 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-03 01:49:54] [INFO ] Deduced a trap composed of 133 places in 192 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:54] [INFO ] Deduced a trap composed of 234 places in 189 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:59] [INFO ] Deduced a trap composed of 110 places in 191 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:59] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:49:59] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1184 variables, and 53 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 13/13 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/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:13] [INFO ] Deduced a trap composed of 206 places in 207 ms of which 62 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1184 variables, and 54 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40445ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40447ms
[2025-06-03 01:50:25] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:50:26] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2025-06-03 01:50:26] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:50:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:50:31] [INFO ] Implicit Places using invariants and state equation in 5319 ms returned []
Implicit Place search using SMT with State Equation took 6427 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:50:31] [INFO ] Redundant transitions in 12 ms returned []
Running 816 sub problems to find dead transitions.
[2025-06-03 01:50:31] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:50:31] [INFO ] Invariant cache hit.
[2025-06-03 01:50:31] [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/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:37] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:39] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:39] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:40] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:41] [INFO ] Deduced a trap composed of 49 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-03 01:50:41] [INFO ] Deduced a trap composed of 49 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-03 01:50:41] [INFO ] Deduced a trap composed of 49 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-03 01:50:45] [INFO ] Deduced a trap composed of 110 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:45] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:54] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:54] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:01] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:01] [INFO ] Deduced a trap composed of 148 places in 225 ms of which 48 ms to minimize.
SMT process timed out in 30413ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 30414ms
Starting structural reductions in SI_LTL mode, iteration 1 : 378/528 places, 818/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77353 ms. Remains : 378/528 places, 818/968 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 3659 reset in 410 ms.
Product exploration explored 100000 steps with 3664 reset in 489 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 117 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (21 resets) in 231 ms. (172 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40000 steps (13 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
[2025-06-03 01:51:03] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:51:03] [INFO ] Invariant cache hit.
[2025-06-03 01:51:03] [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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 324/354 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/363 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 378/1184 variables, and 42 constraints, problems are : Problem set: 2 solved, 0 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 317 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-03 01:51:03] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:51:04] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-06-03 01:51:04] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 559 ms returned sat
[2025-06-03 01:51:18] [INFO ] [Real]Absence check using state equation in 14075 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 21 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 818/818 transitions.
Applied a total of 0 rules in 15 ms. Remains 378 /378 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-03 01:51:19] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:51:19] [INFO ] Invariant cache hit.
[2025-06-03 01:51:19] [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/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:25] [INFO ] Deduced a trap composed of 49 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-03 01:51:27] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:27] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:28] [INFO ] Deduced a trap composed of 49 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-03 01:51:28] [INFO ] Deduced a trap composed of 49 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-03 01:51:28] [INFO ] Deduced a trap composed of 49 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-03 01:51:28] [INFO ] Deduced a trap composed of 49 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-03 01:51:32] [INFO ] Deduced a trap composed of 110 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:33] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1184 variables, and 49 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 9/9 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/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:42] [INFO ] Deduced a trap composed of 148 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-03 01:51:43] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:45] [INFO ] Deduced a trap composed of 15 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-03 01:51:45] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1184 variables, and 53 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40463ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40465ms
[2025-06-03 01:51:59] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:52:00] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2025-06-03 01:52:00] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:52:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:52:05] [INFO ] Implicit Places using invariants and state equation in 5318 ms returned []
Implicit Place search using SMT with State Equation took 6478 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:52:05] [INFO ] Redundant transitions in 13 ms returned []
Running 816 sub problems to find dead transitions.
[2025-06-03 01:52:05] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:52:05] [INFO ] Invariant cache hit.
[2025-06-03 01:52:05] [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/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:12] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:14] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:14] [INFO ] Deduced a trap composed of 234 places in 230 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:15] [INFO ] Deduced a trap composed of 49 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-03 01:52:15] [INFO ] Deduced a trap composed of 49 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-03 01:52:15] [INFO ] Deduced a trap composed of 49 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-03 01:52:15] [INFO ] Deduced a trap composed of 49 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-03 01:52:19] [INFO ] Deduced a trap composed of 110 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:20] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:28] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:29] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:36] [INFO ] Deduced a trap composed of 143 places in 208 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:36] [INFO ] Deduced a trap composed of 148 places in 222 ms of which 50 ms to minimize.
SMT process timed out in 30639ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 30641ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77625 ms. Remains : 378/378 places, 818/818 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 (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 155 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2025-06-03 01:52:37] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 01:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:52:37] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-06-03 01:52:38] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 521 ms returned sat
[2025-06-03 01:52:39] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2025-06-03 01:52:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:52:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-06-03 01:52:39] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 109 ms returned sat
[2025-06-03 01:52:42] [INFO ] [Nat]Absence check using state equation in 3022 ms returned sat
[2025-06-03 01:52:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:52:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 170 ms returned sat
[2025-06-03 01:52:42] [INFO ] Computed and/alt/rep : 432/1935/426 causal constraints (skipped 378 transitions) in 52 ms.
[2025-06-03 01:52:44] [INFO ] Added : 74 causal constraints over 15 iterations in 1945 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 3662 reset in 355 ms.
Product exploration explored 100000 steps with 3666 reset in 412 ms.
Built C files in :
/tmp/ltsmin16929167379782720426
[2025-06-03 01:52:45] [INFO ] Computing symmetric may disable matrix : 818 transitions.
[2025-06-03 01:52:45] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:52:45] [INFO ] Computing symmetric may enable matrix : 818 transitions.
[2025-06-03 01:52:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:52:45] [INFO ] Computing Do-Not-Accords matrix : 818 transitions.
[2025-06-03 01:52:45] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:52:45] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16929167379782720426
Running compilation step : cd /tmp/ltsmin16929167379782720426;'/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 2297 ms.
Running link step : cd /tmp/ltsmin16929167379782720426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16929167379782720426;'/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/stateBased14818234291394662507.hoa' '--buchi-type=spotba'
LTSmin run took 8016 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-08 finished in 191791 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 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 408 transition count 848
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 408 transition count 848
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 336 place count 360 transition count 800
Applied a total of 336 rules in 40 ms. Remains 360 /528 variables (removed 168) and now considering 800/968 (removed 168) transitions.
Running 798 sub problems to find dead transitions.
[2025-06-03 01:52:56] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
// Phase 1: matrix 788 rows 360 cols
[2025-06-03 01:52:56] [INFO ] Computed 42 invariants in 15 ms
[2025-06-03 01:52: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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:02] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:02] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:02] [INFO ] Deduced a trap composed of 46 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-03 01:53:02] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:02] [INFO ] Deduced a trap composed of 46 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-03 01:53:02] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:02] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:03] [INFO ] Deduced a trap composed of 46 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-03 01:53:05] [INFO ] Deduced a trap composed of 216 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-03 01:53:10] [INFO ] Deduced a trap composed of 119 places in 188 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:10] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:10] [INFO ] Deduced a trap composed of 92 places in 202 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:11] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.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 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 358/1148 variables, and 53 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:32] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:33] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:33] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40513ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 40515ms
[2025-06-03 01:53:36] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:53:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:53:37] [INFO ] Implicit Places using invariants in 941 ms returned []
[2025-06-03 01:53:37] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:53:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:53:41] [INFO ] Implicit Places using invariants and state equation in 3759 ms returned []
Implicit Place search using SMT with State Equation took 4702 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:53:41] [INFO ] Redundant transitions in 10 ms returned []
Running 798 sub problems to find dead transitions.
[2025-06-03 01:53:41] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:53:41] [INFO ] Invariant cache hit.
[2025-06-03 01:53:41] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:47] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:47] [INFO ] Deduced a trap composed of 46 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-03 01:53:47] [INFO ] Deduced a trap composed of 46 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-03 01:53:47] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:47] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:47] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:47] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:48] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:48] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:50] [INFO ] Deduced a trap composed of 216 places in 169 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:54] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:55] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:55] [INFO ] Deduced a trap composed of 92 places in 173 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:56] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:03] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:03] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:23] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:23] [INFO ] Deduced a trap composed of 120 places in 188 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 58 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 360/528 places, 800/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105767 ms. Remains : 360/528 places, 800/968 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 3655 reset in 268 ms.
Product exploration explored 100000 steps with 3676 reset in 303 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 102 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2025-06-03 01:54:43] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:54:43] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-03 01:54:44] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 557 ms returned sat
[2025-06-03 01:54:46] [INFO ] [Real]Absence check using state equation in 2057 ms returned sat
[2025-06-03 01:54:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:54:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-06-03 01:54:47] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 790 ms returned sat
[2025-06-03 01:54:49] [INFO ] [Nat]Absence check using state equation in 1896 ms returned sat
[2025-06-03 01:54:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:54:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 660 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:49] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:50] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 11 ms to minimize.
[2025-06-03 01:54:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2025-06-03 01:54:50] [INFO ] Computed and/alt/rep : 414/1917/408 causal constraints (skipped 378 transitions) in 57 ms.
[2025-06-03 01:54:54] [INFO ] Added : 241 causal constraints over 49 iterations in 4393 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 360 /360 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Running 798 sub problems to find dead transitions.
[2025-06-03 01:54:54] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:54:54] [INFO ] Invariant cache hit.
[2025-06-03 01:54:54] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:00] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:00] [INFO ] Deduced a trap composed of 46 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-03 01:55:00] [INFO ] Deduced a trap composed of 46 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-03 01:55:00] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:00] [INFO ] Deduced a trap composed of 46 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-03 01:55:00] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:00] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:01] [INFO ] Deduced a trap composed of 46 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-03 01:55:01] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:03] [INFO ] Deduced a trap composed of 216 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-03 01:55:07] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:08] [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-03 01:55:08] [INFO ] Deduced a trap composed of 92 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-03 01:55:09] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1148 variables, and 54 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:23] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:24] [INFO ] Deduced a trap composed of 120 places in 196 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40494ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 40496ms
[2025-06-03 01:55:34] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:55:35] [INFO ] Implicit Places using invariants in 976 ms returned []
[2025-06-03 01:55:35] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:55:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:55:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:55:39] [INFO ] Implicit Places using invariants and state equation in 3812 ms returned []
Implicit Place search using SMT with State Equation took 4790 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:55:39] [INFO ] Redundant transitions in 8 ms returned []
Running 798 sub problems to find dead transitions.
[2025-06-03 01:55:39] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:55:39] [INFO ] Invariant cache hit.
[2025-06-03 01:55:39] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:45] [INFO ] Deduced a trap composed of 46 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-03 01:55:45] [INFO ] Deduced a trap composed of 46 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-03 01:55:45] [INFO ] Deduced a trap composed of 46 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-03 01:55:45] [INFO ] Deduced a trap composed of 46 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-03 01:55:45] [INFO ] Deduced a trap composed of 46 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-03 01:55:45] [INFO ] Deduced a trap composed of 125 places in 221 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:46] [INFO ] Deduced a trap composed of 130 places in 211 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:46] [INFO ] Deduced a trap composed of 46 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-03 01:55:47] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:48] [INFO ] Deduced a trap composed of 216 places in 175 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:53] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:53] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:53] [INFO ] Deduced a trap composed of 92 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-03 01:55:54] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:56:01] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:56:01] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:56:21] [INFO ] Deduced a trap composed of 115 places in 193 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:56:22] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 58 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60515ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 60517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105833 ms. Remains : 360/360 places, 800/800 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
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 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 110 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2025-06-03 01:56:40] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:56:41] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-06-03 01:56:41] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 558 ms returned sat
[2025-06-03 01:56:43] [INFO ] [Real]Absence check using state equation in 2049 ms returned sat
[2025-06-03 01:56:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:56:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-06-03 01:56:44] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 788 ms returned sat
[2025-06-03 01:56:46] [INFO ] [Nat]Absence check using state equation in 1872 ms returned sat
[2025-06-03 01:56:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:56:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 665 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:56:47] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:56:47] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 11 ms to minimize.
[2025-06-03 01:56:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2025-06-03 01:56:47] [INFO ] Computed and/alt/rep : 414/1917/408 causal constraints (skipped 378 transitions) in 53 ms.
[2025-06-03 01:56:52] [INFO ] Added : 241 causal constraints over 49 iterations in 4400 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3666 reset in 258 ms.
Product exploration explored 100000 steps with 3651 reset in 265 ms.
Built C files in :
/tmp/ltsmin14788283300433525301
[2025-06-03 01:56:52] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2025-06-03 01:56:52] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:56:52] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2025-06-03 01:56:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:56:52] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2025-06-03 01:56:52] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:56:52] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14788283300433525301
Running compilation step : cd /tmp/ltsmin14788283300433525301;'/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 2251 ms.
Running link step : cd /tmp/ltsmin14788283300433525301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14788283300433525301;'/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/stateBased14471373915099406158.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 800/800 transitions.
Applied a total of 0 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Running 798 sub problems to find dead transitions.
[2025-06-03 01:57:07] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:57:07] [INFO ] Invariant cache hit.
[2025-06-03 01:57:07] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:13] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:13] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:13] [INFO ] Deduced a trap composed of 46 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-03 01:57:13] [INFO ] Deduced a trap composed of 46 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-03 01:57:13] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:13] [INFO ] Deduced a trap composed of 125 places in 205 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:13] [INFO ] Deduced a trap composed of 130 places in 205 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:14] [INFO ] Deduced a trap composed of 46 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-03 01:57:14] [INFO ] Deduced a trap composed of 25 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-03 01:57:16] [INFO ] Deduced a trap composed of 216 places in 172 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:20] [INFO ] Deduced a trap composed of 119 places in 186 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:20] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:20] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:21] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1148 variables, and 54 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:36] [INFO ] Deduced a trap composed of 115 places in 181 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:36] [INFO ] Deduced a trap composed of 120 places in 180 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40427ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 40428ms
[2025-06-03 01:57:48] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:57:49] [INFO ] Implicit Places using invariants in 975 ms returned []
[2025-06-03 01:57:49] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:57:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:57:52] [INFO ] Implicit Places using invariants and state equation in 3833 ms returned []
Implicit Place search using SMT with State Equation took 4810 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:57:52] [INFO ] Redundant transitions in 9 ms returned []
Running 798 sub problems to find dead transitions.
[2025-06-03 01:57:52] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 01:57:52] [INFO ] Invariant cache hit.
[2025-06-03 01:57:52] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:58] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:58] [INFO ] Deduced a trap composed of 46 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-03 01:57:58] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:58] [INFO ] Deduced a trap composed of 46 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-03 01:57:58] [INFO ] Deduced a trap composed of 46 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-03 01:57:58] [INFO ] Deduced a trap composed of 125 places in 201 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:59] [INFO ] Deduced a trap composed of 130 places in 209 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:59] [INFO ] Deduced a trap composed of 46 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-03 01:58:00] [INFO ] Deduced a trap composed of 25 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-03 01:58:01] [INFO ] Deduced a trap composed of 216 places in 167 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:05] [INFO ] Deduced a trap composed of 119 places in 174 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:06] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:06] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:07] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:14] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:14] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 798 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 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:34] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:35] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 58 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 60421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105694 ms. Remains : 360/360 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin18429876166407400665
[2025-06-03 01:58:53] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2025-06-03 01:58:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:58:53] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2025-06-03 01:58:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:58:53] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2025-06-03 01:58:53] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:58:53] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18429876166407400665
Running compilation step : cd /tmp/ltsmin18429876166407400665;'/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 2217 ms.
Running link step : cd /tmp/ltsmin18429876166407400665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin18429876166407400665;'/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/stateBased7438282525788155568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 01:59:08] [INFO ] Flatten gal took : 49 ms
[2025-06-03 01:59:08] [INFO ] Flatten gal took : 44 ms
[2025-06-03 01:59:08] [INFO ] Time to serialize gal into /tmp/LTL14938340373344263963.gal : 9 ms
[2025-06-03 01:59:08] [INFO ] Time to serialize properties into /tmp/LTL9984868474820823798.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/LTL14938340373344263963.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17073205919693199756.hoa' '-atoms' '/tmp/LTL9984868474820823798.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...319
Loading property file /tmp/LTL9984868474820823798.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17073205919693199756.hoa
Detected timeout of ITS tools.
[2025-06-03 01:59:23] [INFO ] Flatten gal took : 37 ms
[2025-06-03 01:59:23] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:59:23] [INFO ] Time to serialize gal into /tmp/LTL11890872593195193660.gal : 8 ms
[2025-06-03 01:59:23] [INFO ] Time to serialize properties into /tmp/LTL18080959673792045086.ltl : 3 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/LTL11890872593195193660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18080959673792045086.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 : !((G(F("((((Abort_Check_Sources_E_0+Abort_Check_Sources_E_1)+(Abort_Check_Sources_E_2+Abort_Check_Sources_E_3))+(Abort_Check_Sources_E...192
Formula 0 simplified : FG!"((((Abort_Check_Sources_E_0+Abort_Check_Sources_E_1)+(Abort_Check_Sources_E_2+Abort_Check_Sources_E_3))+(Abort_Check_Sources_E_4...186
Detected timeout of ITS tools.
[2025-06-03 01:59:38] [INFO ] Flatten gal took : 34 ms
[2025-06-03 01:59:38] [INFO ] Applying decomposition
[2025-06-03 01:59:39] [INFO ] Flatten gal took : 38 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/graph8058954308622816437.txt' '-o' '/tmp/graph8058954308622816437.bin' '-w' '/tmp/graph8058954308622816437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8058954308622816437.bin' '-l' '-1' '-v' '-w' '/tmp/graph8058954308622816437.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:59:39] [INFO ] Decomposing Gal with order
[2025-06-03 01:59:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:59:39] [INFO ] Removed a total of 514 redundant transitions.
[2025-06-03 01:59:39] [INFO ] Flatten gal took : 203 ms
[2025-06-03 01:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 331 labels/synchronizations in 26 ms.
[2025-06-03 01:59:39] [INFO ] Time to serialize gal into /tmp/LTL615567268888380711.gal : 9 ms
[2025-06-03 01:59:39] [INFO ] Time to serialize properties into /tmp/LTL18353467055864811690.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL615567268888380711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18353467055864811690.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 : !((G(F("((((gu7.Abort_Check_Sources_E_0+gu7.Abort_Check_Sources_E_1)+(gu7.Abort_Check_Sources_E_2+gu7.Abort_Check_Sources_E_3))+(gu7.A...216
Formula 0 simplified : FG!"((((gu7.Abort_Check_Sources_E_0+gu7.Abort_Check_Sources_E_1)+(gu7.Abort_Check_Sources_E_2+gu7.Abort_Check_Sources_E_3))+(gu7.Abo...210
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-09 finished in 418262 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((X(F(p0))||F(p1))))'
Support contains 13 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 480 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 420 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 414 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 414 transition count 854
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 3 with 84 rules applied. Total rules applied 312 place count 372 transition count 812
Applied a total of 312 rules in 39 ms. Remains 372 /528 variables (removed 156) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 01:59:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2025-06-03 01:59:54] [INFO ] Computed 42 invariants in 19 ms
[2025-06-03 01:59:54] [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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:01] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:01] [INFO ] Deduced a trap composed of 48 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-03 02:00:01] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:01] [INFO ] Deduced a trap composed of 48 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-03 02:00:01] [INFO ] Deduced a trap composed of 48 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-03 02:00:01] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:01] [INFO ] Deduced a trap composed of 142 places in 213 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:02] [INFO ] Deduced a trap composed of 131 places in 214 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:02] [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-03 02:00:02] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:03] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:04] [INFO ] Deduced a trap composed of 228 places in 208 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:09] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:25] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:30] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1172 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40434ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40436ms
[2025-06-03 02:00:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:00:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:00:36] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2025-06-03 02:00:36] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:00:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:00:40] [INFO ] Implicit Places using invariants and state equation in 4665 ms returned []
Implicit Place search using SMT with State Equation took 5783 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:00:40] [INFO ] Redundant transitions in 11 ms returned []
Running 810 sub problems to find dead transitions.
[2025-06-03 02:00:40] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:00:40] [INFO ] Invariant cache hit.
[2025-06-03 02:00: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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:47] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:47] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:47] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:47] [INFO ] Deduced a trap composed of 48 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-03 02:00:47] [INFO ] Deduced a trap composed of 48 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-03 02:00:48] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:48] [INFO ] Deduced a trap composed of 142 places in 190 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:48] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:48] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:48] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:49] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:49] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:49] [INFO ] Deduced a trap composed of 48 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-03 02:00:51] [INFO ] Deduced a trap composed of 228 places in 179 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:56] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:56] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:57] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 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 2.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.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 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.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 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 9.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.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 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 0.0)
(s196 0.0)
(s197 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 30395ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Starting structural reductions in SI_LTL mode, iteration 1 : 372/528 places, 812/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76672 ms. Remains : 372/528 places, 812/968 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-10
Product exploration explored 100000 steps with 33268 reset in 265 ms.
Product exploration explored 100000 steps with 33296 reset in 279 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 159 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 13 out of 372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 372/372 places, 812/812 transitions.
Applied a total of 0 rules in 12 ms. Remains 372 /372 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 02:01:12] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:01:12] [INFO ] Invariant cache hit.
[2025-06-03 02:01:12] [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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 48 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-03 02:01:19] [INFO ] Deduced a trap composed of 48 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-03 02:01:19] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 142 places in 191 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:20] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:20] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:20] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:20] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:20] [INFO ] Deduced a trap composed of 136 places in 202 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:21] [INFO ] Deduced a trap composed of 48 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-03 02:01:22] [INFO ] Deduced a trap composed of 228 places in 183 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:27] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:28] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:28] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 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 1.0)
(s9 3.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 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 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 370/1172 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:51] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1172 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40441ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40443ms
[2025-06-03 02:01:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:01:54] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2025-06-03 02:01:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:01:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:01:58] [INFO ] Implicit Places using invariants and state equation in 4689 ms returned []
Implicit Place search using SMT with State Equation took 5806 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:01:58] [INFO ] Redundant transitions in 9 ms returned []
Running 810 sub problems to find dead transitions.
[2025-06-03 02:01:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:01:58] [INFO ] Invariant cache hit.
[2025-06-03 02:01:58] [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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:05] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:05] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:05] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:05] [INFO ] Deduced a trap composed of 48 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-03 02:02:05] [INFO ] Deduced a trap composed of 48 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-03 02:02:05] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:06] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:06] [INFO ] Deduced a trap composed of 131 places in 186 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:06] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:06] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:06] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:07] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:07] [INFO ] Deduced a trap composed of 48 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-03 02:02:09] [INFO ] Deduced a trap composed of 228 places in 178 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:13] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:14] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:14] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 30359ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 30360ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76639 ms. Remains : 372/372 places, 812/812 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 167 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1659 reset in 266 ms.
Product exploration explored 100000 steps with 1626 reset in 275 ms.
Built C files in :
/tmp/ltsmin1154769923531142186
[2025-06-03 02:02:30] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2025-06-03 02:02:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:02:30] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2025-06-03 02:02:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:02:30] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2025-06-03 02:02:30] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:02:30] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1154769923531142186
Running compilation step : cd /tmp/ltsmin1154769923531142186;'/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 2254 ms.
Running link step : cd /tmp/ltsmin1154769923531142186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1154769923531142186;'/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/stateBased5705166437012849913.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 372/372 places, 812/812 transitions.
Applied a total of 0 rules in 14 ms. Remains 372 /372 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 02:02:45] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:02:45] [INFO ] Invariant cache hit.
[2025-06-03 02:02: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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:51] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:51] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:51] [INFO ] Deduced a trap composed of 48 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-03 02:02:52] [INFO ] Deduced a trap composed of 48 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-03 02:02:52] [INFO ] Deduced a trap composed of 48 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-03 02:02:52] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:52] [INFO ] Deduced a trap composed of 142 places in 214 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:52] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:53] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:53] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:53] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:53] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:54] [INFO ] Deduced a trap composed of 48 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-03 02:02:55] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:00] [INFO ] Deduced a trap composed of 104 places in 193 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:01] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:01] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1172 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40369ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40371ms
[2025-06-03 02:03:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:03:26] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2025-06-03 02:03:26] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:03:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:03:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:03:31] [INFO ] Implicit Places using invariants and state equation in 4678 ms returned []
Implicit Place search using SMT with State Equation took 5830 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:03:31] [INFO ] Redundant transitions in 10 ms returned []
Running 810 sub problems to find dead transitions.
[2025-06-03 02:03:31] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:03:31] [INFO ] Invariant cache hit.
[2025-06-03 02:03:31] [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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 48 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-03 02:03:38] [INFO ] Deduced a trap composed of 48 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-03 02:03:38] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:38] [INFO ] Deduced a trap composed of 142 places in 216 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:40] [INFO ] Deduced a trap composed of 48 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-03 02:03:42] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:46] [INFO ] Deduced a trap composed of 104 places in 195 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:47] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:47] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 30400ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 30402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76642 ms. Remains : 372/372 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin13768318224942331140
[2025-06-03 02:04:01] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2025-06-03 02:04:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:04:02] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2025-06-03 02:04:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:04:02] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2025-06-03 02:04:02] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:04:02] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13768318224942331140
Running compilation step : cd /tmp/ltsmin13768318224942331140;'/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 2271 ms.
Running link step : cd /tmp/ltsmin13768318224942331140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13768318224942331140;'/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/stateBased17185060175451093287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 02:04:17] [INFO ] Flatten gal took : 45 ms
[2025-06-03 02:04:17] [INFO ] Flatten gal took : 41 ms
[2025-06-03 02:04:17] [INFO ] Time to serialize gal into /tmp/LTL8868970768596703820.gal : 5 ms
[2025-06-03 02:04:17] [INFO ] Time to serialize properties into /tmp/LTL2482111113322461530.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/LTL8868970768596703820.gal' '-t' 'CGAL' '-hoa' '/tmp/aut647565681789169013.hoa' '-atoms' '/tmp/LTL2482111113322461530.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...316
Loading property file /tmp/LTL2482111113322461530.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut647565681789169013.hoa
Detected timeout of ITS tools.
[2025-06-03 02:04:32] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:04:32] [INFO ] Flatten gal took : 33 ms
[2025-06-03 02:04:32] [INFO ] Time to serialize gal into /tmp/LTL13245099934888208152.gal : 6 ms
[2025-06-03 02:04:32] [INFO ] Time to serialize properties into /tmp/LTL9067419573271766588.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13245099934888208152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9067419573271766588.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+(NotifyEven...297
Formula 0 simplified : F(XG!"((((NotifyEventSourceAddedB_0+NotifyEventSourceAddedB_1)+(NotifyEventSourceAddedB_2+NotifyEventSourceAddedB_3))+(NotifyEventSo...287
Detected timeout of ITS tools.
[2025-06-03 02:04:47] [INFO ] Flatten gal took : 31 ms
[2025-06-03 02:04:47] [INFO ] Applying decomposition
[2025-06-03 02:04:47] [INFO ] Flatten gal took : 32 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/graph8332711105066530797.txt' '-o' '/tmp/graph8332711105066530797.bin' '-w' '/tmp/graph8332711105066530797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8332711105066530797.bin' '-l' '-1' '-v' '-w' '/tmp/graph8332711105066530797.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:04:47] [INFO ] Decomposing Gal with order
[2025-06-03 02:04:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:04:47] [INFO ] Removed a total of 565 redundant transitions.
[2025-06-03 02:04:47] [INFO ] Flatten gal took : 86 ms
[2025-06-03 02:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 22 ms.
[2025-06-03 02:04:47] [INFO ] Time to serialize gal into /tmp/LTL1766520444623943557.gal : 6 ms
[2025-06-03 02:04:47] [INFO ] Time to serialize properties into /tmp/LTL3898459154507568151.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/LTL1766520444623943557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3898459154507568151.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 : !((G((X(F("((((gu20.NotifyEventSourceAddedB_0+gu20.NotifyEventSourceAddedB_1)+(gu20.NotifyEventSourceAddedB_2+gu20.NotifyEventSourceAd...362
Formula 0 simplified : F(XG!"((((gu20.NotifyEventSourceAddedB_0+gu20.NotifyEventSourceAddedB_1)+(gu20.NotifyEventSourceAddedB_2+gu20.NotifyEventSourceAdded...352
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-10 finished in 308257 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 56 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 408 transition count 848
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 408 transition count 848
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 336 place count 360 transition count 800
Applied a total of 336 rules in 35 ms. Remains 360 /528 variables (removed 168) and now considering 800/968 (removed 168) transitions.
Running 798 sub problems to find dead transitions.
[2025-06-03 02:05:02] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
// Phase 1: matrix 788 rows 360 cols
[2025-06-03 02:05:02] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 02:05:02] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:08] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:08] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:08] [INFO ] Deduced a trap composed of 46 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-03 02:05:08] [INFO ] Deduced a trap composed of 46 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-03 02:05:08] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:09] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:09] [INFO ] Deduced a trap composed of 130 places in 187 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:09] [INFO ] Deduced a trap composed of 46 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-03 02:05:11] [INFO ] Deduced a trap composed of 216 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-03 02:05:16] [INFO ] Deduced a trap composed of 119 places in 202 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:16] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:17] [INFO ] Deduced a trap composed of 92 places in 201 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:17] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 798 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 358/1148 variables, and 53 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:38] [INFO ] Deduced a trap composed of 120 places in 218 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:39] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:40] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40446ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 40447ms
[2025-06-03 02:05:43] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 02:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:05:44] [INFO ] Implicit Places using invariants in 840 ms returned []
[2025-06-03 02:05:44] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 02:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:05:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:05:47] [INFO ] Implicit Places using invariants and state equation in 2947 ms returned []
Implicit Place search using SMT with State Equation took 3789 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:05:47] [INFO ] Redundant transitions in 9 ms returned []
Running 798 sub problems to find dead transitions.
[2025-06-03 02:05:47] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2025-06-03 02:05:47] [INFO ] Invariant cache hit.
[2025-06-03 02:05:47] [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/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:52] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:52] [INFO ] Deduced a trap composed of 46 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-03 02:05:52] [INFO ] Deduced a trap composed of 46 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-03 02:05:52] [INFO ] Deduced a trap composed of 46 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-03 02:05:52] [INFO ] Deduced a trap composed of 46 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-03 02:05:53] [INFO ] Deduced a trap composed of 125 places in 212 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:53] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:54] [INFO ] Deduced a trap composed of 46 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-03 02:05:54] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:56] [INFO ] Deduced a trap composed of 216 places in 173 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:00] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:00] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:01] [INFO ] Deduced a trap composed of 92 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-03 02:06:01] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:09] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:09] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1148 variables, and 56 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:29] [INFO ] Deduced a trap composed of 115 places in 187 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:29] [INFO ] Deduced a trap composed of 120 places in 184 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1148 variables, and 58 constraints, problems are : Problem set: 0 solved, 798 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 360/528 places, 800/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104733 ms. Remains : 360/528 places, 800/968 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-13
Stuttering criterion allowed to conclude after 2563 steps with 0 reset in 14 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-13 finished in 104817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1 U (p2||G(p1)))))))'
Support contains 31 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 26 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:06:47] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 02:06:47] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 02:06:47] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:56] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:56] [INFO ] Deduced a trap composed of 72 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-03 02:06:56] [INFO ] Deduced a trap composed of 72 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-03 02:06:57] [INFO ] Deduced a trap composed of 72 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-03 02:06:57] [INFO ] Deduced a trap composed of 72 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-03 02:06:57] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:57] [INFO ] Deduced a trap composed of 121 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-03 02:06:57] [INFO ] Deduced a trap composed of 72 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-03 02:06:58] [INFO ] Deduced a trap composed of 266 places in 252 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:59] [INFO ] Deduced a trap composed of 250 places in 336 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:59] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:59] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 58 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:16] [INFO ] Deduced a trap composed of 241 places in 266 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:17] [INFO ] Deduced a trap composed of 348 places in 271 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:21] [INFO ] Deduced a trap composed of 246 places in 274 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:22] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40502ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40504ms
[2025-06-03 02:07:28] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:07:28] [INFO ] Implicit Places using invariants in 631 ms returned []
[2025-06-03 02:07:28] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:07:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:07:36] [INFO ] Implicit Places using invariants and state equation in 7387 ms returned []
Implicit Place search using SMT with State Equation took 8023 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:07:36] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:36] [INFO ] Invariant cache hit.
[2025-06-03 02:07: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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:45] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:45] [INFO ] Deduced a trap composed of 72 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-03 02:07:45] [INFO ] Deduced a trap composed of 72 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-03 02:07:45] [INFO ] Deduced a trap composed of 72 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-03 02:07:45] [INFO ] Deduced a trap composed of 72 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-03 02:07:46] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:46] [INFO ] Deduced a trap composed of 121 places in 217 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:46] [INFO ] Deduced a trap composed of 72 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-03 02:07:47] [INFO ] Deduced a trap composed of 250 places in 286 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:47] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:48] [INFO ] Deduced a trap composed of 233 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:56] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:59] [INFO ] Deduced a trap composed of 218 places in 250 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:59] [INFO ] Deduced a trap composed of 266 places in 263 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:18] [INFO ] Deduced a trap composed of 246 places in 275 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:21] [INFO ] Deduced a trap composed of 86 places in 237 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:21] [INFO ] Deduced a trap composed of 284 places in 195 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:30] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 64 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109029 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Product exploration explored 100000 steps with 50000 reset in 395 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) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 16 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-15 finished in 109920 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)))'
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((X(F(p0))||F(p1))))'
[2025-06-03 02:08:37] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17192805968365919174
[2025-06-03 02:08:37] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2025-06-03 02:08:37] [INFO ] Applying decomposition
[2025-06-03 02:08:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:08:37] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2025-06-03 02:08:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:08:37] [INFO ] Flatten gal took : 32 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/graph4728000218530803802.txt' '-o' '/tmp/graph4728000218530803802.bin' '-w' '/tmp/graph4728000218530803802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4728000218530803802.bin' '-l' '-1' '-v' '-w' '/tmp/graph4728000218530803802.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:08:38] [INFO ] Decomposing Gal with order
[2025-06-03 02:08:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:08:38] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2025-06-03 02:08:38] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:08:38] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17192805968365919174
Running compilation step : cd /tmp/ltsmin17192805968365919174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-06-03 02:08:38] [INFO ] Removed a total of 1029 redundant transitions.
[2025-06-03 02:08:38] [INFO ] Flatten gal took : 153 ms
[2025-06-03 02:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 30 ms.
[2025-06-03 02:08:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality10155626370583027863.gal : 7 ms
[2025-06-03 02:08:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality7113333589041836215.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10155626370583027863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7113333589041836215.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 2 LTL properties
Checking formula 0 : !((G(F("((((gu47.Abort_Check_Sources_E_0+gu47.Abort_Check_Sources_E_1)+(gu47.Abort_Check_Sources_E_2+gu47.Abort_Check_Sources_E_3))+(g...222
Formula 0 simplified : FG!"((((gu47.Abort_Check_Sources_E_0+gu47.Abort_Check_Sources_E_1)+(gu47.Abort_Check_Sources_E_2+gu47.Abort_Check_Sources_E_3))+(gu4...216
Compilation finished in 3144 ms.
Running link step : cd /tmp/ltsmin17192805968365919174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17192805968365919174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 17132 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17192805968365919174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp1==true)))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17192805968365919174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp1==true)))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin17192805968365919174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp1==true)))||<>((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 02:38:45] [INFO ] Applying decomposition
[2025-06-03 02:38:46] [INFO ] Flatten gal took : 476 ms
[2025-06-03 02:38:46] [INFO ] Decomposing Gal with order
[2025-06-03 02:38:46] [INFO ] Rewriting arrays to variables to allow decomposition.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-S02J06T06"
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-S02J06T06, 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-174881253700291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 ;