About the Execution of ITS-Tools for BridgeAndVehicles-COL-V10P10N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1043646.00 | 0.00 | 0.00 | TFTFTTFFTTTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764600171.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 BridgeAndVehicles-COL-V10P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764600171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 38K 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 BridgeAndVehicles-COL-V10P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748738663796
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-01 00:44:25] [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-01 00:44:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:44:26] [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-01 00:44:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 00:44:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1146 ms
[2025-06-01 00:44:27] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 45 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 00:44:27] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 11 ms.
[2025-06-01 00:44:27] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (8 resets) in 1473 ms. (27 steps per ms) remains 6/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 561 ms. (71 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/2 properties
// Phase 1: matrix 10 rows 12 cols
[2025-06-01 00:44:28] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-01 00:44:28] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-01 00:44:28] [INFO ] Flatten gal took : 22 ms
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 00:44:28] [INFO ] Flatten gal took : 4 ms
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-06-01 00:44:29] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 51 ms.
[2025-06-01 00:44:29] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 15 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 16 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2025-06-01 00:44:29] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2025-06-01 00:44:29] [INFO ] Computed 7 invariants in 17 ms
[2025-06-01 00:44:29] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:44:31] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:44:31] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 3 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/9 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 20 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/57 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/79 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/79 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/79 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 79 constraints, problems are : Problem set: 22 solved, 263 unsolved in 12662 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/9 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/57 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/79 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 263/342 constraints. Problems are: Problem set: 22 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:44:50] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:44:50] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 2/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/138 variables, and 344 constraints, problems are : Problem set: 22 solved, 263 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 263/285 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33365ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 33382ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
[2025-06-01 00:45:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2025-06-01 00:45:02] [INFO ] Computed 9 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:45:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-01 00:45:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:45:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:45:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:45:02] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/48 places, 266/288 transitions.
Applied a total of 0 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33706 ms. Remains : 48/48 places, 266/288 transitions.
Support contains 15 out of 48 places after structural reductions.
[2025-06-01 00:45:02] [INFO ] Flatten gal took : 44 ms
[2025-06-01 00:45:02] [INFO ] Flatten gal took : 41 ms
[2025-06-01 00:45:03] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (443 resets) in 961 ms. (41 steps per ms) remains 5/27 properties
BEST_FIRST walk for 40004 steps (152 resets) in 287 ms. (138 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (180 resets) in 274 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (148 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
[2025-06-01 00:45:03] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:45:03] [INFO ] Invariant cache hit.
[2025-06-01 00:45:03] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/15 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/37 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/123 variables, 37/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/134 variables, 11/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 77 constraints, problems are : Problem set: 1 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:03] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/37 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 86/123 variables, 37/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 20/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/134 variables, 11/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 1/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/134 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 79 constraints, problems are : Problem set: 1 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 558ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 334 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
Applied a total of 3 rules in 58 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:45:04] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:45:04] [INFO ] Computed 7 invariants in 2 ms
[2025-06-01 00:45:04] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:06] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9686 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:20] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30031ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30096 ms. Remains : 45/48 places, 265/266 transitions.
RANDOM walk for 40000 steps (444 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40010 steps (148 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Probably explored full state space saw : 259552 states, properties seen :0
Probabilistic random walk after 1080822 steps, saw 259552 distinct states, run finished after 2681 ms. (steps per millisecond=403 ) properties seen :0
Explored full state space saw : 259556 states, properties seen :0
Exhaustive walk after 1080838 steps, saw 259556 distinct states, run finished after 2221 ms. (steps per millisecond=486 ) properties seen :0
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 31 stabilizing places and 42 stable transitions
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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)&&F(p1)))||(F(p0)&&F(p1)&&X(X(F(!p0)))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 7 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:45:39] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:45:39] [INFO ] Invariant cache hit.
[2025-06-01 00:45:39] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:41] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:45] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 11819 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32029ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 32030ms
[2025-06-01 00:46:11] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:46:12] [INFO ] Implicit Places using invariants in 216 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 222 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32265 ms. Remains : 43/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 674 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-00
Product exploration explored 100000 steps with 6620 reset in 548 ms.
Product exploration explored 100000 steps with 6580 reset in 321 ms.
Computed a total of 26 stabilizing places and 41 stable transitions
Computed a total of 26 stabilizing places and 41 stable transitions
Detected a total of 26/43 stabilizing places and 41/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 111 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 436 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2025-06-01 00:46:15] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 43 cols
[2025-06-01 00:46:15] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:46:15] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 00:46:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:46:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:46:16] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 00:46:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:46:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2025-06-01 00:46:16] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 26 ms.
[2025-06-01 00:46:16] [INFO ] Added : 17 causal constraints over 4 iterations in 141 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-01 00:46:16] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-01 00:46:16] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-01 00:46:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:46:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-01 00:46:16] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 00:46:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:46:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 150 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:46:17] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 6 ms to minimize.
[2025-06-01 00:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2025-06-01 00:46:17] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 14 ms.
[2025-06-01 00:46:17] [INFO ] Added : 9 causal constraints over 2 iterations in 108 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 265/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:46:17] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:46:17] [INFO ] Invariant cache hit.
[2025-06-01 00:46:17] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:46:18] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8763 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 262/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/128 variables, and 331 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28978ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 28981ms
[2025-06-01 00:46:46] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:46:46] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-01 00:46:46] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:46:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:46:46] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:46:46] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:46:46] [INFO ] Invariant cache hit.
[2025-06-01 00:46:46] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:46:47] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10278 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 262/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 331 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40424ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 40426ms
Finished structural reductions in LTL mode , in 1 iterations and 69766 ms. Remains : 43/43 places, 265/265 transitions.
Computed a total of 26 stabilizing places and 41 stable transitions
Computed a total of 26 stabilizing places and 41 stable transitions
Detected a total of 26/43 stabilizing places and 41/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 313 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 106 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 374 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2025-06-01 00:47:28] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:47:29] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-01 00:47:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:47:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-01 00:47:29] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 00:47:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:47:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 14 ms returned sat
[2025-06-01 00:47:29] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 25 ms.
[2025-06-01 00:47:29] [INFO ] Added : 17 causal constraints over 4 iterations in 134 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-01 00:47:29] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:47:29] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-06-01 00:47:30] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 00:47:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:47:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:47:30] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 00:47:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:47:30] [INFO ] [Nat]Added 20 Read/Feed constraints in 167 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:47:30] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 6 ms to minimize.
[2025-06-01 00:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-06-01 00:47:30] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 22 ms.
[2025-06-01 00:47:30] [INFO ] Added : 9 causal constraints over 2 iterations in 161 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 6759 reset in 333 ms.
Product exploration explored 100000 steps with 6673 reset in 385 ms.
Applying partial POR strategy [false, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 265/265 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 49 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:47:32] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 43 cols
[2025-06-01 00:47:32] [INFO ] Computed 5 invariants in 2 ms
[2025-06-01 00:47:32] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:47:34] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Problem TDEAD10 is UNSAT
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 1 solved, 261 unsolved in 11673 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 261 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 261/330 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/128 variables, and 330 constraints, problems are : Problem set: 1 solved, 261 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31928ms problems are : Problem set: 1 solved, 261 unsolved
Search for dead transitions found 1 dead transitions in 31931ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:48:04] [INFO ] Redundant transitions in 15 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 264/265 transitions.
Graph (complete) has 587 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 17 ms. Remains 41 /43 variables (removed 2) and now considering 264/264 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/43 places, 264/265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32027 ms. Remains : 41/43 places, 264/265 transitions.
Built C files in :
/tmp/ltsmin7052861791131438967
[2025-06-01 00:48:04] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7052861791131438967
Running compilation step : cd /tmp/ltsmin7052861791131438967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1124 ms.
Running link step : cd /tmp/ltsmin7052861791131438967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin7052861791131438967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6636970559013387908.hoa' '--buchi-type=spotba'
LTSmin run took 7593 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-00 finished in 153833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
Applied a total of 3 rules in 18 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:48:13] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:48:13] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:48:13] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:48:14] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7672 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:48:26] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27833ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 27835ms
[2025-06-01 00:48:41] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:48:41] [INFO ] Implicit Places using invariants in 123 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 12 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27991 ms. Remains : 43/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01 finished in 28048 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 (F(p1) U X(p2))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:48:41] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:48:41] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:48:41] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:48:42] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:48:49] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 14309 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34463ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 34464ms
[2025-06-01 00:49:16] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:49:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:49:16] [INFO ] Implicit Places using invariants in 134 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34607 ms. Remains : 44/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
Computed a total of 27 stabilizing places and 42 stable transitions
Computed a total of 27 stabilizing places and 42 stable transitions
Detected a total of 27/44 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 21 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 finished in 35702 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 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
Applied a total of 3 rules in 27 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:49:17] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:49:17] [INFO ] Computed 7 invariants in 2 ms
[2025-06-01 00:49:17] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:49:18] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8750 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:49:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28935ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 28946ms
[2025-06-01 00:49:46] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:49:46] [INFO ] Implicit Places using invariants in 123 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 12 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29111 ms. Remains : 43/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03
Product exploration explored 100000 steps with 2547 reset in 230 ms.
Product exploration explored 100000 steps with 2565 reset in 252 ms.
Computed a total of 26 stabilizing places and 41 stable transitions
Computed a total of 26 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (441 resets) in 268 ms. (148 steps per ms) remains 1/2 properties
BEST_FIRST walk for 680 steps (0 resets) in 7 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-01 00:49:47] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 43 cols
[2025-06-01 00:49:47] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:49:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:49:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 00:49:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:49:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-01 00:49:48] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 00:49:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:49:48] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2025-06-01 00:49:48] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 23 ms.
[2025-06-01 00:49:48] [INFO ] Added : 9 causal constraints over 3 iterations in 110 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 265/265 transitions.
Applied a total of 0 rules in 16 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:49:48] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:49:48] [INFO ] Invariant cache hit.
[2025-06-01 00:49:48] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:49:49] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8235 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 262/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/128 variables, and 331 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28549ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 28551ms
[2025-06-01 00:50:16] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:50:17] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-01 00:50:17] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:50:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:50:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:50:17] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:50:17] [INFO ] Redundant transitions in 7 ms returned []
Running 262 sub problems to find dead transitions.
[2025-06-01 00:50:17] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:50:17] [INFO ] Invariant cache hit.
[2025-06-01 00:50:17] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:50:18] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10417 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 262/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 331 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40708ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 40710ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69805 ms. Remains : 43/43 places, 265/265 transitions.
Computed a total of 26 stabilizing places and 41 stable transitions
Computed a total of 26 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (441 resets) in 146 ms. (272 steps per ms) remains 1/2 properties
BEST_FIRST walk for 634 steps (0 resets) in 6 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-01 00:50:58] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:50:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:50:59] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 00:50:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:50:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:50:59] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 00:50:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:50:59] [INFO ] [Nat]Added 20 Read/Feed constraints in 126 ms returned sat
[2025-06-01 00:50:59] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 16 ms.
[2025-06-01 00:50:59] [INFO ] Added : 9 causal constraints over 2 iterations in 122 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2542 reset in 231 ms.
Product exploration explored 100000 steps with 2613 reset in 230 ms.
Built C files in :
/tmp/ltsmin8544577287783659879
[2025-06-01 00:51:00] [INFO ] Computing symmetric may disable matrix : 265 transitions.
[2025-06-01 00:51:00] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:51:00] [INFO ] Computing symmetric may enable matrix : 265 transitions.
[2025-06-01 00:51:00] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:51:00] [INFO ] Computing Do-Not-Accords matrix : 265 transitions.
[2025-06-01 00:51:00] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:51:00] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8544577287783659879
Running compilation step : cd /tmp/ltsmin8544577287783659879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1208 ms.
Running link step : cd /tmp/ltsmin8544577287783659879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8544577287783659879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1926457324467469907.hoa' '--buchi-type=spotba'
LTSmin run took 1419 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03 finished in 105572 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 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 265
Applied a total of 3 rules in 14 ms. Remains 46 /48 variables (removed 2) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:51:02] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 46 cols
[2025-06-01 00:51:02] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:51:03] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:51:04] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:51:07] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 76 constraints, problems are : Problem set: 0 solved, 262 unsolved in 13474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 262/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 131/131 variables, and 338 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33646ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 33647ms
[2025-06-01 00:51:36] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:51:36] [INFO ] Implicit Places using invariants in 154 ms returned [14, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/48 places, 265/266 transitions.
Applied a total of 0 rules in 14 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33836 ms. Remains : 44/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04
Product exploration explored 100000 steps with 3299 reset in 430 ms.
Product exploration explored 100000 steps with 3299 reset in 289 ms.
Computed a total of 27 stabilizing places and 41 stable transitions
Graph (complete) has 590 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 41 stable transitions
Detected a total of 27/44 stabilizing places and 41/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 89 steps (1 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 265/265 transitions.
Applied a total of 0 rules in 12 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:51:38] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 44 cols
[2025-06-01 00:51:38] [INFO ] Computed 6 invariants in 1 ms
[2025-06-01 00:51:38] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:51:39] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:51:43] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 72 constraints, problems are : Problem set: 0 solved, 262 unsolved in 13571 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 262/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:52:02] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/129 variables, and 335 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33845ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 33847ms
[2025-06-01 00:52:12] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:52:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:52:12] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-01 00:52:12] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:52:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:52:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:52:12] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:52:12] [INFO ] Redundant transitions in 5 ms returned []
Running 262 sub problems to find dead transitions.
[2025-06-01 00:52:12] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:52:12] [INFO ] Invariant cache hit.
[2025-06-01 00:52:12] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:52:14] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:52:17] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 72 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12874 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 262/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 334 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43271ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 43273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77567 ms. Remains : 44/44 places, 265/265 transitions.
Computed a total of 27 stabilizing places and 41 stable transitions
Graph (complete) has 590 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 41 stable transitions
Detected a total of 27/44 stabilizing places and 41/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 104 steps (1 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3319 reset in 247 ms.
Product exploration explored 100000 steps with 3309 reset in 251 ms.
Built C files in :
/tmp/ltsmin2028142199920781192
[2025-06-01 00:52:57] [INFO ] Computing symmetric may disable matrix : 265 transitions.
[2025-06-01 00:52:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:52:57] [INFO ] Computing symmetric may enable matrix : 265 transitions.
[2025-06-01 00:52:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:52:57] [INFO ] Computing Do-Not-Accords matrix : 265 transitions.
[2025-06-01 00:52:57] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 00:52:57] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2028142199920781192
Running compilation step : cd /tmp/ltsmin2028142199920781192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1068 ms.
Running link step : cd /tmp/ltsmin2028142199920781192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin2028142199920781192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7880066735380169764.hoa' '--buchi-type=spotba'
LTSmin run took 12805 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04 finished in 128316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:53:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2025-06-01 00:53:11] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:53:11] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:12] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:16] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 13461 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:44] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33685ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 33687ms
[2025-06-01 00:53:44] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:53:45] [INFO ] Implicit Places using invariants in 106 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33802 ms. Remains : 45/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Computed a total of 28 stabilizing places and 42 stable transitions
Graph (complete) has 592 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 42 stable transitions
Detected a total of 28/45 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 finished in 34365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(!(X(G(p0)) U p1))&&X(p0))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:53:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2025-06-01 00:53:45] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:53:45] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:46] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:49] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:01] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29437ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 29438ms
[2025-06-01 00:54:15] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:54:15] [INFO ] Implicit Places using invariants in 140 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29584 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 finished in 29773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:54:15] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:54:15] [INFO ] Invariant cache hit.
[2025-06-01 00:54:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:16] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:19] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 13928 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:37] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34192ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 34195ms
[2025-06-01 00:54:49] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:54:49] [INFO ] Implicit Places using invariants in 161 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34376 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 32 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 finished in 35253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p0))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 7 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:54:50] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:54:50] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:54:50] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:52] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9763 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:55:06] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30054ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30064ms
[2025-06-01 00:55:20] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:55:20] [INFO ] Implicit Places using invariants in 181 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30262 ms. Remains : 43/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
Product exploration explored 100000 steps with 16841 reset in 203 ms.
Product exploration explored 100000 steps with 17016 reset in 332 ms.
Computed a total of 26 stabilizing places and 41 stable transitions
Computed a total of 26 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 00:55:22] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 43 cols
[2025-06-01 00:55:22] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:55:22] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:55:22] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 00:55:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:55:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:55:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-01 00:55:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:55:22] [INFO ] [Nat]Added 20 Read/Feed constraints in 36 ms returned sat
[2025-06-01 00:55:22] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 11 ms.
[2025-06-01 00:55:22] [INFO ] Added : 11 causal constraints over 3 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 265/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:55:23] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:55:23] [INFO ] Invariant cache hit.
[2025-06-01 00:55:23] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:55:24] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7926 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 262/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/128 variables, and 331 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28214ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 28215ms
[2025-06-01 00:55:51] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:55:51] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-01 00:55:51] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:55:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:55:51] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:55:51] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:55:51] [INFO ] Invariant cache hit.
[2025-06-01 00:55:51] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:55:52] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9878 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 262/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 331 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40134ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 40135ms
Finished structural reductions in LTL mode , in 1 iterations and 68698 ms. Remains : 43/43 places, 265/265 transitions.
Computed a total of 26 stabilizing places and 41 stable transitions
Computed a total of 26 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 00:56:32] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:56:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:56:32] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-01 00:56:32] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 00:56:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:56:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-01 00:56:32] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 00:56:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:56:32] [INFO ] [Nat]Added 20 Read/Feed constraints in 36 ms returned sat
[2025-06-01 00:56:32] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 13 ms.
[2025-06-01 00:56:32] [INFO ] Added : 11 causal constraints over 3 iterations in 101 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16924 reset in 362 ms.
Product exploration explored 100000 steps with 16937 reset in 318 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 265/265 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:56:33] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 43 cols
[2025-06-01 00:56:33] [INFO ] Computed 5 invariants in 0 ms
[2025-06-01 00:56:33] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:56:34] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Problem TDEAD10 is UNSAT
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 69 constraints, problems are : Problem set: 1 solved, 261 unsolved in 7556 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 261 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 85/128 variables, 43/49 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/69 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 261/330 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/128 variables, and 330 constraints, problems are : Problem set: 1 solved, 261 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27754ms problems are : Problem set: 1 solved, 261 unsolved
Search for dead transitions found 1 dead transitions in 27755ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:57:01] [INFO ] Redundant transitions in 3 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 264/265 transitions.
Graph (complete) has 587 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 41 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 25 ms. Remains 41 /43 variables (removed 2) and now considering 264/264 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/43 places, 264/265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27812 ms. Remains : 41/43 places, 264/265 transitions.
Built C files in :
/tmp/ltsmin2587160434440264784
[2025-06-01 00:57:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2587160434440264784
Running compilation step : cd /tmp/ltsmin2587160434440264784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 771 ms.
Running link step : cd /tmp/ltsmin2587160434440264784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2587160434440264784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10989021555941771722.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 finished in 132058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:57:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:57:02] [INFO ] Computed 7 invariants in 5 ms
[2025-06-01 00:57:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:04] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:10] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 11858 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32131ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 32133ms
[2025-06-01 00:57:34] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:57:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:57:35] [INFO ] Implicit Places using invariants in 187 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 190 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32331 ms. Remains : 44/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 finished in 32570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 4 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:57:35] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:57:35] [INFO ] Invariant cache hit.
[2025-06-01 00:57:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:36] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 74 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9707 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:52] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30003ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30005ms
[2025-06-01 00:58:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:58:05] [INFO ] Implicit Places using invariants in 212 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 215 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30232 ms. Remains : 44/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13 finished in 30482 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) U (X(p2)&&(G(p3)||(p3&&F(!p0)))))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:58:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2025-06-01 00:58:05] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:58:05] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:58:07] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:58:11] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 13143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:58:26] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33493ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 33494ms
[2025-06-01 00:58:39] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:58:39] [INFO ] Implicit Places using invariants in 150 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33652 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 982 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) p3 (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p3 (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p3 (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p3) (NOT p2)), (AND (NOT p1) p3 (NOT p2)), (NOT p2), (AND p0 (NOT p3)), (AND (NOT p1) p0), (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), (AND (NOT p1) p0 p3 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14
Stuttering criterion allowed to conclude after 488 steps with 44 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 finished in 34710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(F(p2))))'
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:58:40] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2025-06-01 00:58:40] [INFO ] Computed 8 invariants in 1 ms
[2025-06-01 00:58:40] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:58:41] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:58:44] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:08] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30903ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30905ms
[2025-06-01 00:59:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:59:11] [INFO ] Implicit Places using invariants in 126 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31038 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
Product exploration explored 100000 steps with 2715 reset in 639 ms.
Product exploration explored 100000 steps with 2740 reset in 254 ms.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 480 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 182 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 508 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2025-06-01 00:59:14] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:59:14] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:59:14] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 00:59:14] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 00:59:14] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 00:59:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 00:59:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 00:59:14] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 00:59:14] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 00:59:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:59:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 95 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:14] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 6 ms to minimize.
[2025-06-01 00:59:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-01 00:59:14] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 18 ms.
[2025-06-01 00:59:14] [INFO ] Added : 13 causal constraints over 3 iterations in 192 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:59:14] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:59:14] [INFO ] Invariant cache hit.
[2025-06-01 00:59:14] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:15] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:19] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10080 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30365ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30366ms
[2025-06-01 00:59:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:59:45] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-01 00:59:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:59:45] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:59:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:59:45] [INFO ] Invariant cache hit.
[2025-06-01 00:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:47] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:50] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 12127 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42439ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 42441ms
Finished structural reductions in LTL mode , in 1 iterations and 73221 ms. Remains : 46/46 places, 266/266 transitions.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 181 steps (0 resets) in 6 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 318 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2025-06-01 01:00:29] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 01:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 01:00:29] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 01:00:29] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 01:00:29] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 01:00:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 01:00:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 01:00:29] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:00:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-01 01:00:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 01:00:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 25 ms returned sat
[2025-06-01 01:00:29] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 18 ms.
[2025-06-01 01:00:29] [INFO ] Added : 17 causal constraints over 4 iterations in 214 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 2677 reset in 386 ms.
Product exploration explored 100000 steps with 2668 reset in 258 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 9 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 01:00:30] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 01:00:30] [INFO ] Invariant cache hit.
[2025-06-01 01:00:30] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:00:31] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:00:35] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10102 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30308ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30309ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:01:01] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2025-06-01 01:01:01] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 01:01:01] [INFO ] Invariant cache hit.
[2025-06-01 01:01:01] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:01:02] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:01:06] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 12850 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43113ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 43114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73449 ms. Remains : 46/46 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin7070595689781959605
[2025-06-01 01:01:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7070595689781959605
Running compilation step : cd /tmp/ltsmin7070595689781959605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 727 ms.
Running link step : cd /tmp/ltsmin7070595689781959605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7070595689781959605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8865074451225068311.hoa' '--buchi-type=spotba'
LTSmin run took 2239 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 finished in 186895 ms.
All properties solved by simple procedures.
Total runtime 1041573 ms.
BK_STOP 1748739707442
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V10P10N10"
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 BridgeAndVehicles-COL-V10P10N10, 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 r016-smll-174853764600171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 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 '
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 ;