Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K 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 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 47K 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 Peterson-COL-7-LTLCardinality-00
FORMULA_NAME Peterson-COL-7-LTLCardinality-01
FORMULA_NAME Peterson-COL-7-LTLCardinality-02
FORMULA_NAME Peterson-COL-7-LTLCardinality-03
FORMULA_NAME Peterson-COL-7-LTLCardinality-04
FORMULA_NAME Peterson-COL-7-LTLCardinality-05
FORMULA_NAME Peterson-COL-7-LTLCardinality-06
FORMULA_NAME Peterson-COL-7-LTLCardinality-07
FORMULA_NAME Peterson-COL-7-LTLCardinality-08
FORMULA_NAME Peterson-COL-7-LTLCardinality-09
FORMULA_NAME Peterson-COL-7-LTLCardinality-10
FORMULA_NAME Peterson-COL-7-LTLCardinality-11
FORMULA_NAME Peterson-COL-7-LTLCardinality-12
FORMULA_NAME Peterson-COL-7-LTLCardinality-13
FORMULA_NAME Peterson-COL-7-LTLCardinality-14
FORMULA_NAME Peterson-COL-7-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748935731918

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-03 07:28:53] [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 07:28:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:28:53] [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 07:28:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 07:28:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2025-06-03 07:28:53] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 18 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 07:28:53] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2025-06-03 07:28:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-COL-7-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-7-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40013 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
// Phase 1: matrix 14 rows 9 cols
[2025-06-03 07:28:54] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 9/23 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA Peterson-COL-7-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 07:28:54] [INFO ] Flatten gal took : 13 ms
[2025-06-03 07:28:54] [INFO ] Flatten gal took : 2 ms
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-03 07:28:54] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 54 ms.
[2025-06-03 07:28:54] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 56 places in 18 ms
Reduce places removed 56 places and 112 transitions.
Support contains 1920 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 58 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 07:28:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 07:28:54] [INFO ] Computed 31 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:28:56] [INFO ] Implicit Places using invariants in 2081 ms returned []
[2025-06-03 07:28:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:28:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:29:03] [INFO ] Implicit Places using invariants and state equation in 6744 ms returned []
Implicit Place search using SMT with State Equation took 8841 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2025-06-03 07:29:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:29:03] [INFO ] Invariant cache hit.
[2025-06-03 07:29:03] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31244ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31263ms
Finished structural reductions in LTL mode , in 1 iterations and 40195 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1920 out of 1992 places after structural reductions.
[2025-06-03 07:29:35] [INFO ] Flatten gal took : 164 ms
[2025-06-03 07:29:35] [INFO ] Flatten gal took : 120 ms
[2025-06-03 07:29:35] [INFO ] Input system was already deterministic with 3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 2128 ms. (18 steps per ms) remains 7/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 949 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
[2025-06-03 07:29:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:29:36] [INFO ] Invariant cache hit.
[2025-06-03 07:29:36] [INFO ] State equation strengthened by 497 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/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1928 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1928 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/1936 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1936 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2760/4696 variables, 1936/1960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4696 variables, 497/2457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4696 variables, 0/2457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4752/4752 variables, and 2513 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1992/1992 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1024/1928 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 109 places in 781 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 137 places in 625 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:44] [INFO ] Deduced a trap composed of 221 places in 601 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 165 places in 864 ms of which 264 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1928 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1928 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1936 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1936 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 10059ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 904 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 1600 transition count 2704
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 784 place count 1600 transition count 2648
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 896 place count 1544 transition count 2648
Applied a total of 896 rules in 297 ms. Remains 1544 /1992 variables (removed 448) and now considering 2648/3096 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 1544/1992 places, 2648/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1045 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 122337 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 122337 steps, saw 83107 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-03 07:29:50] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
// Phase 1: matrix 2312 rows 1544 cols
[2025-06-03 07:29:50] [INFO ] Computed 31 invariants in 18 ms
[2025-06-03 07:29:50] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1480 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1480 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/1488 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1488 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2312/3800 variables, 1488/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3800 variables, 497/2009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3800 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 56/3856 variables, 56/2065 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3856 variables, 7/2072 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3856 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3856 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3856/3856 variables, and 2072 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9142 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1544/1544 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1480 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:01] [INFO ] Deduced a trap composed of 109 places in 569 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:01] [INFO ] Deduced a trap composed of 130 places in 480 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:01] [INFO ] Deduced a trap composed of 172 places in 404 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:02] [INFO ] Deduced a trap composed of 130 places in 709 ms of which 183 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1480 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:03] [INFO ] Deduced a trap composed of 340 places in 219 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:04] [INFO ] Deduced a trap composed of 88 places in 736 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:04] [INFO ] Deduced a trap composed of 235 places in 288 ms of which 76 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1480 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1488 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1488 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2312/3800 variables, 1488/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3800 variables, 497/2016 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3800 variables, 2/2018 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:12] [INFO ] Deduced a trap composed of 172 places in 410 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:13] [INFO ] Deduced a trap composed of 214 places in 278 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:13] [INFO ] Deduced a trap composed of 235 places in 188 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:15] [INFO ] Deduced a trap composed of 151 places in 610 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:15] [INFO ] Deduced a trap composed of 214 places in 583 ms of which 224 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:16] [INFO ] Deduced a trap composed of 256 places in 445 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:16] [INFO ] Deduced a trap composed of 298 places in 387 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:17] [INFO ] Deduced a trap composed of 319 places in 221 ms of which 46 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3800 variables, 8/2026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:20] [INFO ] Deduced a trap composed of 277 places in 348 ms of which 130 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3800 variables, 1/2027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:23] [INFO ] Deduced a trap composed of 193 places in 408 ms of which 140 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3800 variables, 1/2028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3800 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 56/3856 variables, 56/2084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3856 variables, 7/2091 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:29] [INFO ] Deduced a trap composed of 12 places in 684 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:30] [INFO ] Deduced a trap composed of 12 places in 698 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:31] [INFO ] Deduced a trap composed of 12 places in 663 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:32] [INFO ] Deduced a trap composed of 12 places in 671 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:32] [INFO ] Deduced a trap composed of 12 places in 635 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:33] [INFO ] Deduced a trap composed of 12 places in 621 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:34] [INFO ] Deduced a trap composed of 15 places in 650 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:35] [INFO ] Deduced a trap composed of 12 places in 663 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:35] [INFO ] Deduced a trap composed of 26 places in 668 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:36] [INFO ] Deduced a trap composed of 26 places in 622 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:37] [INFO ] Deduced a trap composed of 26 places in 642 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:38] [INFO ] Deduced a trap composed of 26 places in 634 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:38] [INFO ] Deduced a trap composed of 26 places in 642 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:39] [INFO ] Deduced a trap composed of 26 places in 675 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:40] [INFO ] Deduced a trap composed of 28 places in 618 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:41] [INFO ] Deduced a trap composed of 26 places in 620 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:41] [INFO ] Deduced a trap composed of 38 places in 627 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 38 places in 612 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:43] [INFO ] Deduced a trap composed of 38 places in 612 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:43] [INFO ] Deduced a trap composed of 38 places in 598 ms of which 80 ms to minimize.
Problem AtomicPropp7 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/3856 variables, 20/2111 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3856/3856 variables, and 2111 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1544/1544 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54222ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 904 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2648/2648 transitions.
Applied a total of 0 rules in 76 ms. Remains 1544 /1544 variables (removed 0) and now considering 2648/2648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1544/1544 places, 2648/2648 transitions.
RANDOM walk for 40000 steps (8 resets) in 1025 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 101259 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 3
Probabilistic random walk after 101259 steps, saw 69222 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-03 07:30:48] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
[2025-06-03 07:30:48] [INFO ] Invariant cache hit.
[2025-06-03 07:30:48] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 576/1480 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:49] [INFO ] Deduced a trap composed of 193 places in 261 ms of which 67 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1480 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1480 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/1488 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1488 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2312/3800 variables, 1488/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3800 variables, 497/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3800 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 56/3856 variables, 56/2066 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3856 variables, 7/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3856 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3856 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3856/3856 variables, and 2073 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6331 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1544/1544 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/904 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 576/1480 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1480 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:56] [INFO ] Deduced a trap composed of 109 places in 561 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:56] [INFO ] Deduced a trap composed of 130 places in 465 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:56] [INFO ] Deduced a trap composed of 151 places in 385 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:57] [INFO ] Deduced a trap composed of 235 places in 195 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1480 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:58] [INFO ] Deduced a trap composed of 88 places in 763 ms of which 150 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/1488 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:58] [INFO ] Deduced a trap composed of 172 places in 385 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:59] [INFO ] Deduced a trap composed of 214 places in 190 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:59] [INFO ] Deduced a trap composed of 130 places in 450 ms of which 133 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1488 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1488 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2312/3800 variables, 1488/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3800 variables, 497/2018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3800 variables, 1/2019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:03] [INFO ] Deduced a trap composed of 340 places in 200 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:03] [INFO ] Deduced a trap composed of 214 places in 257 ms of which 70 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3800 variables, 2/2021 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:06] [INFO ] Deduced a trap composed of 172 places in 392 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:06] [INFO ] Deduced a trap composed of 277 places in 339 ms of which 128 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3800 variables, 2/2023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:09] [INFO ] Deduced a trap composed of 193 places in 402 ms of which 133 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3800 variables, 1/2024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3800 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 56/3856 variables, 56/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3856 variables, 7/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:13] [INFO ] Deduced a trap composed of 12 places in 628 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:14] [INFO ] Deduced a trap composed of 28 places in 682 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:14] [INFO ] Deduced a trap composed of 26 places in 672 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:15] [INFO ] Deduced a trap composed of 26 places in 676 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:16] [INFO ] Deduced a trap composed of 38 places in 533 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:16] [INFO ] Deduced a trap composed of 38 places in 557 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:17] [INFO ] Deduced a trap composed of 40 places in 539 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:18] [INFO ] Deduced a trap composed of 50 places in 487 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:18] [INFO ] Deduced a trap composed of 52 places in 483 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:19] [INFO ] Deduced a trap composed of 50 places in 476 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:19] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:20] [INFO ] Deduced a trap composed of 64 places in 419 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:21] [INFO ] Deduced a trap composed of 62 places in 426 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:21] [INFO ] Deduced a trap composed of 74 places in 394 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:22] [INFO ] Deduced a trap composed of 76 places in 376 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:22] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:23] [INFO ] Deduced a trap composed of 38 places in 466 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:24] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:24] [INFO ] Deduced a trap composed of 50 places in 453 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:25] [INFO ] Deduced a trap composed of 38 places in 451 ms of which 58 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3856 variables, 20/2107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:28] [INFO ] Deduced a trap composed of 12 places in 618 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:28] [INFO ] Deduced a trap composed of 12 places in 623 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:29] [INFO ] Deduced a trap composed of 12 places in 630 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:30] [INFO ] Deduced a trap composed of 12 places in 611 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:31] [INFO ] Deduced a trap composed of 15 places in 653 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:31] [INFO ] Deduced a trap composed of 12 places in 636 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 12 places in 591 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 26 places in 563 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 26 places in 527 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:34] [INFO ] Deduced a trap composed of 26 places in 563 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:35] [INFO ] Deduced a trap composed of 26 places in 559 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:35] [INFO ] Deduced a trap composed of 62 places in 496 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:36] [INFO ] Deduced a trap composed of 74 places in 434 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:36] [INFO ] Deduced a trap composed of 86 places in 343 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:37] [INFO ] Deduced a trap composed of 88 places in 434 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:37] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:39] [INFO ] Deduced a trap composed of 50 places in 535 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:39] [INFO ] Deduced a trap composed of 62 places in 462 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:40] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:41] [INFO ] Deduced a trap composed of 86 places in 342 ms of which 70 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3856 variables, 20/2127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:43] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:44] [INFO ] Deduced a trap composed of 38 places in 430 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:45] [INFO ] Deduced a trap composed of 50 places in 474 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:46] [INFO ] Deduced a trap composed of 50 places in 470 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:47] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:47] [INFO ] Deduced a trap composed of 74 places in 313 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:49] [INFO ] Deduced a trap composed of 38 places in 391 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:49] [INFO ] Deduced a trap composed of 62 places in 287 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:50] [INFO ] Deduced a trap composed of 74 places in 319 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:50] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:51] [INFO ] Deduced a trap composed of 86 places in 342 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:53] [INFO ] Deduced a trap composed of 89 places in 453 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:54] [INFO ] Deduced a trap composed of 89 places in 465 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:54] [INFO ] Deduced a trap composed of 94 places in 420 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:55] [INFO ] Deduced a trap composed of 104 places in 336 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:55] [INFO ] Deduced a trap composed of 109 places in 316 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:56] [INFO ] Deduced a trap composed of 104 places in 325 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:56] [INFO ] Deduced a trap composed of 104 places in 341 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:57] [INFO ] Deduced a trap composed of 104 places in 344 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:58] [INFO ] Deduced a trap composed of 59 places in 301 ms of which 59 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3856 variables, 20/2147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:03] [INFO ] Deduced a trap composed of 35 places in 636 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:04] [INFO ] Deduced a trap composed of 35 places in 630 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:05] [INFO ] Deduced a trap composed of 35 places in 608 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:06] [INFO ] Deduced a trap composed of 35 places in 612 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:06] [INFO ] Deduced a trap composed of 37 places in 629 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:07] [INFO ] Deduced a trap composed of 53 places in 610 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:08] [INFO ] Deduced a trap composed of 52 places in 636 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:08] [INFO ] Deduced a trap composed of 55 places in 615 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:09] [INFO ] Deduced a trap composed of 53 places in 633 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:10] [INFO ] Deduced a trap composed of 73 places in 563 ms of which 118 ms to minimize.
SMT process timed out in 81548ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3462 ms.
Support contains 904 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2648/2648 transitions.
Applied a total of 0 rules in 51 ms. Remains 1544 /1544 variables (removed 0) and now considering 2648/2648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1544/1544 places, 2648/2648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2648/2648 transitions.
Applied a total of 0 rules in 43 ms. Remains 1544 /1544 variables (removed 0) and now considering 2648/2648 (removed 0) transitions.
[2025-06-03 07:32:13] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
[2025-06-03 07:32:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:15] [INFO ] Implicit Places using invariants in 1162 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1168 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1536/1544 places, 2648/2648 transitions.
Applied a total of 0 rules in 41 ms. Remains 1536 /1536 variables (removed 0) and now considering 2648/2648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1256 ms. Remains : 1536/1544 places, 2648/2648 transitions.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Peterson-COL-7-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(p0) U (X(G(p0))||(p0&&X(p0))))))||(X((X(p0) U (X(G(p0))||(p0&&X(p0)))))&&F(((p1&&X(p0)) U (G((p1&&X(p0)))||(p1&&X(p2))))))))'
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 49 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 07:32:15] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-03 07:32:15] [INFO ] Computed 31 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:17] [INFO ] Implicit Places using invariants in 1697 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1707 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 49 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1805 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 668 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA Peterson-COL-7-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLCardinality-00 finished in 2563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p0)&&X(X(X(F(p1))))))))'
Support contains 504 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 40 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 07:32:18] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:32:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:20] [INFO ] Implicit Places using invariants in 2940 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2948 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 37 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3025 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 473 ms.
Stack based approach found an accepted trace after 1511 steps with 0 reset with depth 1512 and stack size 1512 in 9 ms.
FORMULA Peterson-COL-7-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-01 finished in 3950 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(G((p0&&X(p1)))) U G(p0)))'
Support contains 120 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 56 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 07:32:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:24] [INFO ] Implicit Places using invariants in 2818 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2823 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 52 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2934 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-7-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLCardinality-04 finished in 3168 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))||F(p1)))'
Support contains 560 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 32 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 07:32:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:28] [INFO ] Implicit Places using invariants in 2966 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2972 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 34 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3039 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 1476 ms.
Product exploration explored 100000 steps with 33333 reset in 1428 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 p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-7-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-07 finished in 6190 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(G((F(p0)||X((p1||X(p2)))))))'
Support contains 560 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 32 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2025-06-03 07:32:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-03 07:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:34] [INFO ] Implicit Places using invariants in 2915 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2918 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 27 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2978 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-10
Product exploration explored 100000 steps with 2285 reset in 494 ms.
Stack based approach found an accepted trace after 4690 steps with 109 reset with depth 109 and stack size 109 in 21 ms.
FORMULA Peterson-COL-7-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-10 finished in 3766 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)&&F(G(p1)))))'
Support contains 960 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 1600 transition count 2704
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 784 place count 1600 transition count 2648
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 896 place count 1544 transition count 2648
Applied a total of 896 rules in 152 ms. Remains 1544 /1992 variables (removed 448) and now considering 2648/3096 (removed 448) transitions.
[2025-06-03 07:32:35] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
// Phase 1: matrix 2312 rows 1544 cols
[2025-06-03 07:32:35] [INFO ] Computed 31 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:37] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2025-06-03 07:32:37] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
[2025-06-03 07:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:32:48] [INFO ] Implicit Places using invariants and state equation in 11722 ms returned []
Implicit Place search using SMT with State Equation took 13560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:32:48] [INFO ] Redundant transitions in 125 ms returned []
Running 2640 sub problems to find dead transitions.
[2025-06-03 07:32:48] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
[2025-06-03 07:32:48] [INFO ] Invariant cache hit.
[2025-06-03 07:32:48] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1536 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
SMT process timed out in 30784ms, After SMT, problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 30794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1544/1992 places, 2648/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44654 ms. Remains : 1544/1992 places, 2648/3096 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 2022 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA Peterson-COL-7-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-12 finished in 46814 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)&&F(G(!p1)))))'
Support contains 560 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 1992 transition count 3040
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 1936 transition count 3040
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 351 Pre rules applied. Total rules applied 112 place count 1936 transition count 2689
Deduced a syphon composed of 351 places in 2 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 2 with 702 rules applied. Total rules applied 814 place count 1585 transition count 2689
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 912 place count 1536 transition count 2640
Applied a total of 912 rules in 224 ms. Remains 1536 /1992 variables (removed 456) and now considering 2640/3096 (removed 456) transitions.
[2025-06-03 07:33:22] [INFO ] Flow matrix only has 2304 transitions (discarded 336 similar events)
// Phase 1: matrix 2304 rows 1536 cols
[2025-06-03 07:33:22] [INFO ] Computed 31 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:33:24] [INFO ] Implicit Places using invariants in 2042 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2051 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1528/1992 places, 2640/3096 transitions.
Applied a total of 0 rules in 33 ms. Remains 1528 /1528 variables (removed 0) and now considering 2640/2640 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2309 ms. Remains : 1528/1992 places, 2640/3096 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 650 ms.
Stack based approach found an accepted trace after 2053 steps with 0 reset with depth 2054 and stack size 2051 in 12 ms.
FORMULA Peterson-COL-7-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-13 finished in 3102 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 64 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 889 transitions
Trivial Post-agglo rules discarded 889 transitions
Performed 889 trivial Post agglomeration. Transition count delta: 889
Iterating post reduction 0 with 889 rules applied. Total rules applied 889 place count 1992 transition count 2207
Reduce places removed 889 places and 0 transitions.
Iterating post reduction 1 with 889 rules applied. Total rules applied 1778 place count 1103 transition count 2207
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1778 place count 1103 transition count 1808
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 2576 place count 704 transition count 1808
Applied a total of 2576 rules in 89 ms. Remains 704 /1992 variables (removed 1288) and now considering 1808/3096 (removed 1288) transitions.
[2025-06-03 07:33:25] [INFO ] Flow matrix only has 1472 transitions (discarded 336 similar events)
// Phase 1: matrix 1472 rows 704 cols
[2025-06-03 07:33:25] [INFO ] Computed 31 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:33:25] [INFO ] Implicit Places using invariants in 637 ms returned []
[2025-06-03 07:33:25] [INFO ] Flow matrix only has 1472 transitions (discarded 336 similar events)
[2025-06-03 07:33:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:33:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:33:30] [INFO ] Implicit Places using invariants and state equation in 5204 ms returned []
Implicit Place search using SMT with State Equation took 5843 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:33:31] [INFO ] Redundant transitions in 101 ms returned []
Running 1800 sub problems to find dead transitions.
[2025-06-03 07:33:31] [INFO ] Flow matrix only has 1472 transitions (discarded 336 similar events)
[2025-06-03 07:33:31] [INFO ] Invariant cache hit.
[2025-06-03 07:33:31] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:49] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:50] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:50] [INFO ] Deduced a trap composed of 28 places in 458 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:51] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:51] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:51] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:51] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:52] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:53] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:54] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:55] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:56] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:56] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:57] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:57] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:57] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:57] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:58] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:58] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:58] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/696 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:59] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/2176 variables, and 44 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/704 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/696 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:04] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:07] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:07] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:08] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:10] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:10] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:10] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:10] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:11] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:11] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:12] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:13] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:13] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:13] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:13] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:14] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:14] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:15] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:16] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:16] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:16] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:17] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:17] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:17] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:18] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:18] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:19] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:19] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:19] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:20] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:20] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:20] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:21] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:21] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:21] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:22] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:22] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:22] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:23] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:27] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:27] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:27] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:28] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:31] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:31] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 19 ms to minimize.
SMT process timed out in 60522ms, After SMT, problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Starting structural reductions in SI_LTL mode, iteration 1 : 704/1992 places, 1808/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66569 ms. Remains : 704/1992 places, 1808/3096 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-14
Product exploration explored 100000 steps with 3979 reset in 448 ms.
Stack based approach found an accepted trace after 1707 steps with 65 reset with depth 15 and stack size 15 in 9 ms.
FORMULA Peterson-COL-7-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-14 finished in 67127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U G(p2))))'
Support contains 1736 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 1992 transition count 3040
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 1936 transition count 3040
Applied a total of 112 rules in 46 ms. Remains 1936 /1992 variables (removed 56) and now considering 3040/3096 (removed 56) transitions.
[2025-06-03 07:34:32] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
// Phase 1: matrix 2704 rows 1936 cols
[2025-06-03 07:34:32] [INFO ] Computed 31 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:33] [INFO ] Implicit Places using invariants in 1762 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1765 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1928/1992 places, 3040/3096 transitions.
Applied a total of 0 rules in 27 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1838 ms. Remains : 1928/1992 places, 3040/3096 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-15
Product exploration explored 100000 steps with 4385 reset in 6355 ms.
Product exploration explored 100000 steps with 4350 reset in 6298 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 p2 p0 p1), (X p2), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (OR (AND p2 p0) (AND p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p2 p1 p0)), (X p0), (X p1), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 124 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 4222 ms. (9 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 9/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 9/9 properties
[2025-06-03 07:34:48] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
// Phase 1: matrix 2704 rows 1928 cols
[2025-06-03 07:34:48] [INFO ] Computed 23 invariants in 12 ms
[2025-06-03 07:34:48] [INFO ] State equation strengthened by 497 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/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/1872 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2704/4576 variables, 1872/1888 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4576 variables, 497/2385 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 0/2385 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 56/4632 variables, 56/2441 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4632 variables, 7/2448 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4632/4632 variables, and 2448 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1928/1928 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf10 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:55] [INFO ] Deduced a trap composed of 95 places in 1050 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:56] [INFO ] Deduced a trap composed of 151 places in 978 ms of which 291 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:57] [INFO ] Deduced a trap composed of 179 places in 831 ms of which 279 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:58] [INFO ] Deduced a trap composed of 207 places in 683 ms of which 253 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:58] [INFO ] Deduced a trap composed of 375 places in 262 ms of which 67 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 5/13 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/4632 variables, and 13 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/23 constraints, State Equation: 0/1928 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10114ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 23 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1928/1928 places, 3040/3040 transitions.
RANDOM walk for 40000 steps (8 resets) in 1637 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 578 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 730 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 108558 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 108558 steps, saw 68846 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
[2025-06-03 07:35:02] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:35:02] [INFO ] Invariant cache hit.
[2025-06-03 07:35:02] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/1872 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2704/4576 variables, 1872/1888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4576 variables, 497/2385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 0/2385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 56/4632 variables, 56/2441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4632 variables, 7/2448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4632 variables, 0/2448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/4632 variables, 0/2448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4632/4632 variables, and 2448 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4704 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1928/1928 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:09] [INFO ] Deduced a trap composed of 95 places in 1062 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:10] [INFO ] Deduced a trap composed of 151 places in 981 ms of which 291 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:11] [INFO ] Deduced a trap composed of 179 places in 801 ms of which 279 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:11] [INFO ] Deduced a trap composed of 263 places in 580 ms of which 234 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1864 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1872 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1872 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2704/4576 variables, 1872/1892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 497/2389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:15] [INFO ] Deduced a trap composed of 235 places in 205 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/4576 variables, 1/2390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4576 variables, 0/2390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 56/4632 variables, 56/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4632 variables, 7/2453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:19] [INFO ] Deduced a trap composed of 13 places in 1036 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:20] [INFO ] Deduced a trap composed of 13 places in 1028 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:21] [INFO ] Deduced a trap composed of 40 places in 823 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:22] [INFO ] Deduced a trap composed of 40 places in 808 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:23] [INFO ] Deduced a trap composed of 40 places in 817 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:24] [INFO ] Deduced a trap composed of 40 places in 750 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:25] [INFO ] Deduced a trap composed of 43 places in 801 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:26] [INFO ] Deduced a trap composed of 39 places in 782 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:27] [INFO ] Deduced a trap composed of 40 places in 810 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:27] [INFO ] Deduced a trap composed of 61 places in 710 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:28] [INFO ] Deduced a trap composed of 61 places in 718 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:29] [INFO ] Deduced a trap composed of 64 places in 721 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:30] [INFO ] Deduced a trap composed of 61 places in 722 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:31] [INFO ] Deduced a trap composed of 61 places in 687 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:32] [INFO ] Deduced a trap composed of 60 places in 710 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 51 places in 720 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:34] [INFO ] Deduced a trap composed of 43 places in 700 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:35] [INFO ] Deduced a trap composed of 44 places in 746 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:35] [INFO ] Deduced a trap composed of 44 places in 724 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:36] [INFO ] Deduced a trap composed of 44 places in 755 ms of which 91 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4632 variables, 20/2473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:38] [INFO ] Deduced a trap composed of 44 places in 728 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:39] [INFO ] Deduced a trap composed of 44 places in 787 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:39] [INFO ] Deduced a trap composed of 69 places in 650 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:41] [INFO ] Deduced a trap composed of 69 places in 667 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:42] [INFO ] Deduced a trap composed of 18 places in 920 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:43] [INFO ] Deduced a trap composed of 13 places in 909 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:44] [INFO ] Deduced a trap composed of 13 places in 909 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:45] [INFO ] Deduced a trap composed of 13 places in 961 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:46] [INFO ] Deduced a trap composed of 13 places in 951 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:47] [INFO ] Deduced a trap composed of 13 places in 982 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:48] [INFO ] Deduced a trap composed of 76 places in 664 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:49] [INFO ] Deduced a trap composed of 69 places in 695 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:50] [INFO ] Deduced a trap composed of 68 places in 686 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:52] [INFO ] Deduced a trap composed of 69 places in 700 ms of which 120 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4632/4632 variables, and 2487 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1928/1928 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49746ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 29 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1928/1928 places, 3040/3040 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 23 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
[2025-06-03 07:35:52] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:35:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:35:54] [INFO ] Implicit Places using invariants in 1541 ms returned []
[2025-06-03 07:35:54] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:35:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:36:04] [INFO ] Implicit Places using invariants and state equation in 10225 ms returned []
Implicit Place search using SMT with State Equation took 11769 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:36:04] [INFO ] Redundant transitions in 160 ms returned []
Running 3032 sub problems to find dead transitions.
[2025-06-03 07:36:04] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:36:04] [INFO ] Invariant cache hit.
[2025-06-03 07:36:04] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1928/4632 variables, and 23 constraints, problems are : Problem set: 0 solved, 3032 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1928 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 3032/3032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:41] [INFO ] Deduced a trap composed of 16 places in 791 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:42] [INFO ] Deduced a trap composed of 20 places in 880 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:43] [INFO ] Deduced a trap composed of 24 places in 820 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:44] [INFO ] Deduced a trap composed of 28 places in 865 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:45] [INFO ] Deduced a trap composed of 32 places in 796 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:46] [INFO ] Deduced a trap composed of 36 places in 864 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:46] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:47] [INFO ] Deduced a trap composed of 20 places in 808 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:48] [INFO ] Deduced a trap composed of 52 places in 862 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:49] [INFO ] Deduced a trap composed of 58 places in 813 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:49] [INFO ] Deduced a trap composed of 62 places in 882 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:50] [INFO ] Deduced a trap composed of 66 places in 813 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:51] [INFO ] Deduced a trap composed of 70 places in 787 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:52] [INFO ] Deduced a trap composed of 17 places in 935 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:53] [INFO ] Deduced a trap composed of 44 places in 939 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:54] [INFO ] Deduced a trap composed of 17 places in 975 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:55] [INFO ] Deduced a trap composed of 21 places in 885 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:56] [INFO ] Deduced a trap composed of 54 places in 906 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:57] [INFO ] Deduced a trap composed of 17 places in 912 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:36:58] [INFO ] Deduced a trap composed of 40 places in 921 ms of which 97 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1928 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:03] [INFO ] Deduced a trap composed of 81 places in 835 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:04] [INFO ] Deduced a trap composed of 91 places in 867 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:05] [INFO ] Deduced a trap composed of 95 places in 867 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:06] [INFO ] Deduced a trap composed of 99 places in 816 ms of which 176 ms to minimize.
SMT process timed out in 61807ms, After SMT, problems are : Problem set: 0 solved, 3032 unsolved
Search for dead transitions found 0 dead transitions in 61813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73785 ms. Remains : 1928/1928 places, 3040/3040 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (OR (AND p2 p0) (AND p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p2 p1 p0)), (X p0), (X p1), (X (X p2)), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 p1 p0))), (X (X p0)), (X (X p1)), (G (OR p0 p2 p1)), (G (OR p2 p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p2))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 46 factoid took 522 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 27 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
[2025-06-03 07:37:07] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:37:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:37:08] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2025-06-03 07:37:08] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:37:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:37:19] [INFO ] Implicit Places using invariants and state equation in 10341 ms returned []
Implicit Place search using SMT with State Equation took 11838 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:37:19] [INFO ] Redundant transitions in 96 ms returned []
Running 3032 sub problems to find dead transitions.
[2025-06-03 07:37:19] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:37:19] [INFO ] Invariant cache hit.
[2025-06-03 07:37:19] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.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 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 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 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1928/4632 variables, and 23 constraints, problems are : Problem set: 0 solved, 3032 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1928 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 3032/3032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:56] [INFO ] Deduced a trap composed of 16 places in 866 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:57] [INFO ] Deduced a trap composed of 20 places in 806 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:58] [INFO ] Deduced a trap composed of 24 places in 872 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:37:59] [INFO ] Deduced a trap composed of 28 places in 843 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:00] [INFO ] Deduced a trap composed of 32 places in 754 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:00] [INFO ] Deduced a trap composed of 36 places in 825 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:01] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:01] [INFO ] Deduced a trap composed of 20 places in 809 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:02] [INFO ] Deduced a trap composed of 52 places in 846 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:03] [INFO ] Deduced a trap composed of 58 places in 822 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:04] [INFO ] Deduced a trap composed of 62 places in 918 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:05] [INFO ] Deduced a trap composed of 66 places in 848 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:06] [INFO ] Deduced a trap composed of 70 places in 838 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:07] [INFO ] Deduced a trap composed of 17 places in 935 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:08] [INFO ] Deduced a trap composed of 44 places in 895 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:09] [INFO ] Deduced a trap composed of 17 places in 968 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:10] [INFO ] Deduced a trap composed of 21 places in 878 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:11] [INFO ] Deduced a trap composed of 54 places in 900 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:12] [INFO ] Deduced a trap composed of 17 places in 938 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:13] [INFO ] Deduced a trap composed of 40 places in 933 ms of which 96 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1928 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:18] [INFO ] Deduced a trap composed of 81 places in 900 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:19] [INFO ] Deduced a trap composed of 91 places in 843 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:20] [INFO ] Deduced a trap composed of 95 places in 825 ms of which 176 ms to minimize.
SMT process timed out in 61071ms, After SMT, problems are : Problem set: 0 solved, 3032 unsolved
Search for dead transitions found 0 dead transitions in 61077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73062 ms. Remains : 1928/1928 places, 3040/3040 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 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 113 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 4199 ms. (9 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 9/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 9/9 properties
[2025-06-03 07:38:22] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:38:22] [INFO ] Invariant cache hit.
[2025-06-03 07:38:22] [INFO ] State equation strengthened by 497 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/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/1872 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2704/4576 variables, 1872/1888 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4576 variables, 497/2385 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 0/2385 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 56/4632 variables, 56/2441 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SMT process timed out in 5065ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 27 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1928/1928 places, 3040/3040 transitions.
RANDOM walk for 40000 steps (8 resets) in 2914 ms. (13 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 825 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 971 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1203 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1205 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 780 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1205 ms. (33 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 269046 steps, run timeout after 9001 ms. (steps per millisecond=29 ) properties seen :0 out of 7
Probabilistic random walk after 269046 steps, saw 159097 distinct states, run finished after 9002 ms. (steps per millisecond=29 ) properties seen :0
[2025-06-03 07:38:39] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:38:39] [INFO ] Invariant cache hit.
[2025-06-03 07:38:39] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/1872 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2704/4576 variables, 1872/1888 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4576 variables, 497/2385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 0/2385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 56/4632 variables, 56/2441 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4632 variables, 7/2448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4632 variables, 0/2448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/4632 variables, 0/2448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4632/4632 variables, and 2448 constraints, problems are : Problem set: 0 solved, 7 unsolved in 13133 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1928/1928 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf10 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:54] [INFO ] Deduced a trap composed of 95 places in 1040 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:55] [INFO ] Deduced a trap composed of 151 places in 960 ms of which 278 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:56] [INFO ] Deduced a trap composed of 263 places in 574 ms of which 229 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:56] [INFO ] Deduced a trap composed of 291 places in 402 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:38:56] [INFO ] Deduced a trap composed of 319 places in 272 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1864 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1872 variables, 8/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1872 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2704/4576 variables, 1872/1893 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 497/2390 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4576 variables, 0/2390 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 56/4632 variables, 56/2446 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4632 variables, 7/2453 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:02] [INFO ] Deduced a trap composed of 13 places in 1015 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:03] [INFO ] Deduced a trap composed of 13 places in 948 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:04] [INFO ] Deduced a trap composed of 13 places in 917 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:05] [INFO ] Deduced a trap composed of 13 places in 1018 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:06] [INFO ] Deduced a trap composed of 13 places in 973 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:07] [INFO ] Deduced a trap composed of 18 places in 987 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:08] [INFO ] Deduced a trap composed of 13 places in 950 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:09] [INFO ] Deduced a trap composed of 13 places in 991 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:10] [INFO ] Deduced a trap composed of 40 places in 727 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:11] [INFO ] Deduced a trap composed of 40 places in 680 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:12] [INFO ] Deduced a trap composed of 43 places in 703 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:13] [INFO ] Deduced a trap composed of 39 places in 703 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:14] [INFO ] Deduced a trap composed of 40 places in 737 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:14] [INFO ] Deduced a trap composed of 40 places in 704 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:15] [INFO ] Deduced a trap composed of 40 places in 727 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:16] [INFO ] Deduced a trap composed of 69 places in 792 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:17] [INFO ] Deduced a trap composed of 69 places in 737 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:18] [INFO ] Deduced a trap composed of 76 places in 749 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:19] [INFO ] Deduced a trap composed of 69 places in 721 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:20] [INFO ] Deduced a trap composed of 68 places in 701 ms of which 125 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4632 variables, 20/2473 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:21] [INFO ] Deduced a trap composed of 69 places in 741 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:22] [INFO ] Deduced a trap composed of 69 places in 742 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:23] [INFO ] Deduced a trap composed of 94 places in 673 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:24] [INFO ] Deduced a trap composed of 94 places in 636 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:24] [INFO ] Deduced a trap composed of 94 places in 637 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:25] [INFO ] Deduced a trap composed of 101 places in 682 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:26] [INFO ] Deduced a trap composed of 93 places in 614 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:27] [INFO ] Deduced a trap composed of 94 places in 659 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:28] [INFO ] Deduced a trap composed of 94 places in 891 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:30] [INFO ] Deduced a trap composed of 119 places in 729 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:31] [INFO ] Deduced a trap composed of 119 places in 758 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:31] [INFO ] Deduced a trap composed of 119 places in 768 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:32] [INFO ] Deduced a trap composed of 118 places in 775 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:33] [INFO ] Deduced a trap composed of 119 places in 763 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:34] [INFO ] Deduced a trap composed of 119 places in 783 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:35] [INFO ] Deduced a trap composed of 126 places in 764 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:37] [INFO ] Deduced a trap composed of 182 places in 691 ms of which 201 ms to minimize.
SMT process timed out in 58448ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1219 ms.
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 21 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1928/1928 places, 3040/3040 transitions.
RANDOM walk for 40000 steps (8 resets) in 1302 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 779 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 767 ms. (52 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 90549 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 4
Probabilistic random walk after 90549 steps, saw 58138 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2025-06-03 07:39:43] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:39:43] [INFO ] Invariant cache hit.
[2025-06-03 07:39:43] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/1872 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1872 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2704/4576 variables, 1872/1888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4576 variables, 497/2385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 0/2385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 56/4632 variables, 56/2441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4632 variables, 7/2448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4632 variables, 0/2448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/4632 variables, 0/2448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4632/4632 variables, and 2448 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4579 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1928/1928 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/1864 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:49] [INFO ] Deduced a trap composed of 95 places in 1000 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:50] [INFO ] Deduced a trap composed of 151 places in 909 ms of which 281 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:51] [INFO ] Deduced a trap composed of 179 places in 805 ms of which 270 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:51] [INFO ] Deduced a trap composed of 263 places in 589 ms of which 227 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1864 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1864 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1872 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1872 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2704/4576 variables, 1872/1892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4576 variables, 497/2389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:55] [INFO ] Deduced a trap composed of 235 places in 218 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/4576 variables, 1/2390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4576 variables, 0/2390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 56/4632 variables, 56/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4632 variables, 7/2453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:39:59] [INFO ] Deduced a trap composed of 13 places in 959 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:00] [INFO ] Deduced a trap composed of 13 places in 944 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:01] [INFO ] Deduced a trap composed of 40 places in 775 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:02] [INFO ] Deduced a trap composed of 40 places in 752 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:03] [INFO ] Deduced a trap composed of 40 places in 795 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:04] [INFO ] Deduced a trap composed of 40 places in 733 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:04] [INFO ] Deduced a trap composed of 40 places in 791 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:05] [INFO ] Deduced a trap composed of 43 places in 782 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:06] [INFO ] Deduced a trap composed of 39 places in 749 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:07] [INFO ] Deduced a trap composed of 18 places in 954 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:08] [INFO ] Deduced a trap composed of 13 places in 867 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:09] [INFO ] Deduced a trap composed of 13 places in 910 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:10] [INFO ] Deduced a trap composed of 13 places in 895 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:11] [INFO ] Deduced a trap composed of 13 places in 894 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:12] [INFO ] Deduced a trap composed of 13 places in 879 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:13] [INFO ] Deduced a trap composed of 61 places in 728 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:14] [INFO ] Deduced a trap composed of 61 places in 678 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:15] [INFO ] Deduced a trap composed of 64 places in 721 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:16] [INFO ] Deduced a trap composed of 61 places in 707 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:17] [INFO ] Deduced a trap composed of 61 places in 696 ms of which 119 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4632 variables, 20/2473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:18] [INFO ] Deduced a trap composed of 60 places in 719 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:19] [INFO ] Deduced a trap composed of 51 places in 701 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:20] [INFO ] Deduced a trap composed of 44 places in 745 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:20] [INFO ] Deduced a trap composed of 43 places in 690 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:21] [INFO ] Deduced a trap composed of 44 places in 683 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:22] [INFO ] Deduced a trap composed of 44 places in 678 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:23] [INFO ] Deduced a trap composed of 44 places in 683 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:24] [INFO ] Deduced a trap composed of 44 places in 717 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:25] [INFO ] Deduced a trap composed of 69 places in 664 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:25] [INFO ] Deduced a trap composed of 69 places in 683 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:26] [INFO ] Deduced a trap composed of 69 places in 653 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:27] [INFO ] Deduced a trap composed of 68 places in 1033 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:28] [INFO ] Deduced a trap composed of 69 places in 660 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:29] [INFO ] Deduced a trap composed of 76 places in 670 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:30] [INFO ] Deduced a trap composed of 69 places in 647 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:31] [INFO ] Deduced a trap composed of 61 places in 710 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:33] [INFO ] Deduced a trap composed of 69 places in 675 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:34] [INFO ] Deduced a trap composed of 94 places in 661 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:34] [INFO ] Deduced a trap composed of 94 places in 691 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:35] [INFO ] Deduced a trap composed of 93 places in 728 ms of which 153 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4632 variables, 20/2493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:37] [INFO ] Deduced a trap composed of 94 places in 723 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:38] [INFO ] Deduced a trap composed of 94 places in 698 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:38] [INFO ] Deduced a trap composed of 101 places in 725 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:39] [INFO ] Deduced a trap composed of 94 places in 656 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:41] [INFO ] Deduced a trap composed of 119 places in 598 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:41] [INFO ] Deduced a trap composed of 119 places in 620 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:42] [INFO ] Deduced a trap composed of 126 places in 599 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:43] [INFO ] Deduced a trap composed of 119 places in 584 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:43] [INFO ] Deduced a trap composed of 118 places in 592 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:44] [INFO ] Deduced a trap composed of 119 places in 553 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:45] [INFO ] Deduced a trap composed of 143 places in 633 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:46] [INFO ] Deduced a trap composed of 144 places in 695 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:47] [INFO ] Deduced a trap composed of 144 places in 649 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:48] [INFO ] Deduced a trap composed of 151 places in 679 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:49] [INFO ] Deduced a trap composed of 144 places in 712 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:49] [INFO ] Deduced a trap composed of 144 places in 671 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:40:51] [INFO ] Deduced a trap composed of 223 places in 573 ms of which 171 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4632 variables, 17/2510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4632 variables, 0/2510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/4632 variables, 0/2510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4632/4632 variables, and 2510 constraints, problems are : Problem set: 0 solved, 4 unsolved in 69088 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1928/1928 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73700ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1326 ms.
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 25 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1928/1928 places, 3040/3040 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 21 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
[2025-06-03 07:40:58] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:40:59] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2025-06-03 07:40:59] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:40:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:41:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:41:09] [INFO ] Implicit Places using invariants and state equation in 10037 ms returned []
Implicit Place search using SMT with State Equation took 11550 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:41:09] [INFO ] Redundant transitions in 59 ms returned []
Running 3032 sub problems to find dead transitions.
[2025-06-03 07:41:09] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:41:09] [INFO ] Invariant cache hit.
[2025-06-03 07:41:09] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1928/4632 variables, and 23 constraints, problems are : Problem set: 0 solved, 3032 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1928 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 3032/3032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:46] [INFO ] Deduced a trap composed of 16 places in 734 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:47] [INFO ] Deduced a trap composed of 20 places in 800 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:48] [INFO ] Deduced a trap composed of 24 places in 837 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:49] [INFO ] Deduced a trap composed of 28 places in 852 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:50] [INFO ] Deduced a trap composed of 32 places in 791 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:51] [INFO ] Deduced a trap composed of 36 places in 832 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:51] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:52] [INFO ] Deduced a trap composed of 20 places in 809 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:53] [INFO ] Deduced a trap composed of 52 places in 871 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:53] [INFO ] Deduced a trap composed of 58 places in 818 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:54] [INFO ] Deduced a trap composed of 62 places in 876 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:55] [INFO ] Deduced a trap composed of 66 places in 790 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:56] [INFO ] Deduced a trap composed of 70 places in 768 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:57] [INFO ] Deduced a trap composed of 17 places in 938 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:58] [INFO ] Deduced a trap composed of 44 places in 918 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:41:59] [INFO ] Deduced a trap composed of 17 places in 1005 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:00] [INFO ] Deduced a trap composed of 21 places in 946 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:01] [INFO ] Deduced a trap composed of 54 places in 901 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:02] [INFO ] Deduced a trap composed of 17 places in 868 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:03] [INFO ] Deduced a trap composed of 40 places in 919 ms of which 100 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1928 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:08] [INFO ] Deduced a trap composed of 81 places in 811 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:09] [INFO ] Deduced a trap composed of 91 places in 820 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:10] [INFO ] Deduced a trap composed of 95 places in 865 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:42:11] [INFO ] Deduced a trap composed of 99 places in 781 ms of which 175 ms to minimize.
SMT process timed out in 61426ms, After SMT, problems are : Problem set: 0 solved, 3032 unsolved
Search for dead transitions found 0 dead transitions in 61430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73084 ms. Remains : 1928/1928 places, 3040/3040 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR p0 p2 p1)), (G (OR p2 p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p2))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT (AND p2 p1)))]
Knowledge based reduction with 46 factoid took 479 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 4419 reset in 5518 ms.
Product exploration explored 100000 steps with 4406 reset in 5561 ms.
Built C files in :
/tmp/ltsmin17879064495505782929
[2025-06-03 07:42:23] [INFO ] Too many transitions (3040) to apply POR reductions. Disabling POR matrices.
[2025-06-03 07:42:23] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17879064495505782929
Running compilation step : cd /tmp/ltsmin17879064495505782929;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17879064495505782929;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17879064495505782929;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1736 out of 1928 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1928/1928 places, 3040/3040 transitions.
Applied a total of 0 rules in 22 ms. Remains 1928 /1928 variables (removed 0) and now considering 3040/3040 (removed 0) transitions.
[2025-06-03 07:42:26] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:28] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2025-06-03 07:42:28] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:42:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:29] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-03 07:42:38] [INFO ] Implicit Places using invariants and state equation in 10076 ms returned []
Implicit Place search using SMT with State Equation took 11581 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:42:38] [INFO ] Redundant transitions in 59 ms returned []
Running 3032 sub problems to find dead transitions.
[2025-06-03 07:42:38] [INFO ] Flow matrix only has 2704 transitions (discarded 336 similar events)
[2025-06-03 07:42:38] [INFO ] Invariant cache hit.
[2025-06-03 07:42:38] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1928/4632 variables, and 23 constraints, problems are : Problem set: 0 solved, 3032 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1928 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 3032/3032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1928 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:15] [INFO ] Deduced a trap composed of 16 places in 744 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:16] [INFO ] Deduced a trap composed of 20 places in 813 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:16] [INFO ] Deduced a trap composed of 24 places in 794 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:17] [INFO ] Deduced a trap composed of 28 places in 788 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:18] [INFO ] Deduced a trap composed of 32 places in 797 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:19] [INFO ] Deduced a trap composed of 36 places in 799 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:19] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:20] [INFO ] Deduced a trap composed of 20 places in 788 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:21] [INFO ] Deduced a trap composed of 52 places in 843 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:22] [INFO ] Deduced a trap composed of 58 places in 744 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:23] [INFO ] Deduced a trap composed of 62 places in 856 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:23] [INFO ] Deduced a trap composed of 66 places in 784 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:24] [INFO ] Deduced a trap composed of 70 places in 795 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:25] [INFO ] Deduced a trap composed of 17 places in 919 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:26] [INFO ] Deduced a trap composed of 44 places in 889 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:27] [INFO ] Deduced a trap composed of 17 places in 950 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:28] [INFO ] Deduced a trap composed of 21 places in 913 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:29] [INFO ] Deduced a trap composed of 54 places in 858 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:30] [INFO ] Deduced a trap composed of 17 places in 890 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:31] [INFO ] Deduced a trap composed of 40 places in 905 ms of which 98 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1928 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3032 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:36] [INFO ] Deduced a trap composed of 81 places in 859 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:37] [INFO ] Deduced a trap composed of 91 places in 839 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:38] [INFO ] Deduced a trap composed of 95 places in 795 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:43:39] [INFO ] Deduced a trap composed of 99 places in 766 ms of which 175 ms to minimize.
SMT process timed out in 60982ms, After SMT, problems are : Problem set: 0 solved, 3032 unsolved
Search for dead transitions found 0 dead transitions in 60987ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72658 ms. Remains : 1928/1928 places, 3040/3040 transitions.
Built C files in :
/tmp/ltsmin3603334582357074069
[2025-06-03 07:43:39] [INFO ] Too many transitions (3040) to apply POR reductions. Disabling POR matrices.
[2025-06-03 07:43:39] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3603334582357074069
Running compilation step : cd /tmp/ltsmin3603334582357074069;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3603334582357074069;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3603334582357074069;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 07:43:42] [INFO ] Flatten gal took : 84 ms
[2025-06-03 07:43:42] [INFO ] Flatten gal took : 78 ms
[2025-06-03 07:43:42] [INFO ] Time to serialize gal into /tmp/LTL13706867717235628709.gal : 18 ms
[2025-06-03 07:43:42] [INFO ] Time to serialize properties into /tmp/LTL15649822470388580991.prop : 2 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/LTL13706867717235628709.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12775337932429243319.hoa' '-atoms' '/tmp/LTL15649822470388580991.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...320
Loading property file /tmp/LTL15649822470388580991.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12775337932429243319.hoa
Detected timeout of ITS tools.
[2025-06-03 07:43:58] [INFO ] Flatten gal took : 71 ms
[2025-06-03 07:43:58] [INFO ] Flatten gal took : 71 ms
[2025-06-03 07:43:58] [INFO ] Time to serialize gal into /tmp/LTL7599745294983711318.gal : 14 ms
[2025-06-03 07:43:58] [INFO ] Time to serialize properties into /tmp/LTL13196210244403323502.ltl : 6 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/LTL7599745294983711318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13196210244403323502.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("((((((((((BeginLoop_0+BeginLoop_1)+(BeginLoop_2+BeginLoop_3))+((BeginLoop_4+BeginLoop_5)+(BeginLoop_6+BeginLoop_7)))+(((BeginLo...28745
Formula 0 simplified : F!"((((((((((BeginLoop_0+BeginLoop_1)+(BeginLoop_2+BeginLoop_3))+((BeginLoop_4+BeginLoop_5)+(BeginLoop_6+BeginLoop_7)))+(((BeginLoop...28739
Detected timeout of ITS tools.
[2025-06-03 07:44:13] [INFO ] Flatten gal took : 67 ms
[2025-06-03 07:44:13] [INFO ] Applying decomposition
[2025-06-03 07:44:13] [INFO ] Flatten gal took : 66 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/graph3179913273161574338.txt' '-o' '/tmp/graph3179913273161574338.bin' '-w' '/tmp/graph3179913273161574338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3179913273161574338.bin' '-l' '-1' '-v' '-w' '/tmp/graph3179913273161574338.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:44:14] [INFO ] Decomposing Gal with order
[2025-06-03 07:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:44:16] [INFO ] Removed a total of 2872 redundant transitions.
[2025-06-03 07:44:16] [INFO ] Flatten gal took : 1934 ms
[2025-06-03 07:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 42 ms.
[2025-06-03 07:44:17] [INFO ] Time to serialize gal into /tmp/LTL5563406914178268306.gal : 22 ms
[2025-06-03 07:44:17] [INFO ] Time to serialize properties into /tmp/LTL16214197756982629849.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/LTL5563406914178268306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16214197756982629849.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("((((((((((gu26.BeginLoop_0+gu26.BeginLoop_1)+(gu26.BeginLoop_2+gu26.BeginLoop_3))+((gu26.BeginLoop_4+gu26.BeginLoop_5)+(gu26.Be...37425
Formula 0 simplified : F!"((((((((((gu26.BeginLoop_0+gu26.BeginLoop_1)+(gu26.BeginLoop_2+gu26.BeginLoop_3))+((gu26.BeginLoop_4+gu26.BeginLoop_5)+(gu26.Begi...37419
Detected timeout of ITS tools.
Treatment of property Peterson-COL-7-LTLCardinality-15 finished in 600084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U G(p2))))'
[2025-06-03 07:44:32] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15766587572619932537
[2025-06-03 07:44:32] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2025-06-03 07:44:32] [INFO ] Applying decomposition
[2025-06-03 07:44:32] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15766587572619932537
Running compilation step : cd /tmp/ltsmin15766587572619932537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 07:44:32] [INFO ] Flatten gal took : 68 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/graph12481268854856313549.txt' '-o' '/tmp/graph12481268854856313549.bin' '-w' '/tmp/graph12481268854856313549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12481268854856313549.bin' '-l' '-1' '-v' '-w' '/tmp/graph12481268854856313549.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:44:33] [INFO ] Decomposing Gal with order
[2025-06-03 07:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:44:35] [INFO ] Removed a total of 2474 redundant transitions.
[2025-06-03 07:44:35] [INFO ] Flatten gal took : 1706 ms
[2025-06-03 07:44:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-03 07:44:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality11816868379781793735.gal : 19 ms
[2025-06-03 07:44:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality15148576947963316988.ltl : 2 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/LTLCardinality11816868379781793735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15148576947963316988.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((gu44.BeginLoop_0+gu44.BeginLoop_1)+(gu44.BeginLoop_2+gu44.BeginLoop_3))+((gu44.BeginLoop_4+gu44.BeginLoop_5)+(gu44.Be...37425
Formula 0 simplified : F!"((((((((((gu44.BeginLoop_0+gu44.BeginLoop_1)+(gu44.BeginLoop_2+gu44.BeginLoop_3))+((gu44.BeginLoop_4+gu44.BeginLoop_5)+(gu44.Begi...37419
Compilation finished in 7565 ms.
Running link step : cd /tmp/ltsmin15766587572619932537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin15766587572619932537;'/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)) U ((LTLAPp1==true) U []((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 08:09:51] [INFO ] Applying decomposition
[2025-06-03 08:09:52] [INFO ] Flatten gal took : 785 ms
[2025-06-03 08:09:52] [INFO ] Decomposing Gal with order
[2025-06-03 08:09:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:09:53] [INFO ] Removed a total of 2952 redundant transitions.
[2025-06-03 08:09:54] [INFO ] Flatten gal took : 1106 ms
[2025-06-03 08:09:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2025-06-03 08:09:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality2418158403476096172.gal : 21 ms
[2025-06-03 08:09:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality1295438551804512726.ltl : 4 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/LTLCardinality2418158403476096172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1295438551804512726.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...297
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((gProcessTourProcess0.BeginLoop_0+gProcessTourProcess1.BeginLoop_1)+(gProcessTourProcess2.BeginLoop_2+gProcessTourProc...68248
Formula 0 simplified : F!"((((((((((gProcessTourProcess0.BeginLoop_0+gProcessTourProcess1.BeginLoop_1)+(gProcessTourProcess2.BeginLoop_2+gProcessTourProces...68242

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Peterson-COL-7"
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 Peterson-COL-7, 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 r142-tall-174876812900587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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