Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397500091.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-COL-V50P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.4K Apr 13 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 02:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 02:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716278434748

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:00:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:00:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:00:36] [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.
[2024-05-21 08:00:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:00:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 591 ms
[2024-05-21 08:00:37] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 08:00:37] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2024-05-21 08:00:37] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-14 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.16 ms
Remains 13 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
RANDOM walk for 40000 steps (8 resets) in 2271 ms. (17 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:00:38] [INFO ] Computed 4 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 1 solved, 2 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 1 solved, 2 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-21 08:00:38] [INFO ] Flatten gal took : 15 ms
[2024-05-21 08:00:38] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:00:38] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 70 ms.
[2024-05-21 08:00:38] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 15 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 44 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-05-21 08:00:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 08:00:38] [INFO ] Computed 7 invariants in 25 ms
[2024-05-21 08:00:38] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-05-21 08:00:50] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 9 ms to minimize.
[2024-05-21 08:00:55] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-05-21 08:00:59] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
[2024-05-21 08:01:16] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 11 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 4/4 constraints]
After SMT, in 46662ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 46697ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2024-05-21 08:01:25] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-05-21 08:01:25] [INFO ] Computed 7 invariants in 12 ms
[2024-05-21 08:01:25] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 08:01:25] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 08:01:25] [INFO ] Invariant cache hit.
[2024-05-21 08:01:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:01:25] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47348 ms. Remains : 128/128 places, 1228/1328 transitions.
Support contains 15 out of 128 places after structural reductions.
[2024-05-21 08:01:26] [INFO ] Flatten gal took : 83 ms
[2024-05-21 08:01:26] [INFO ] Flatten gal took : 70 ms
[2024-05-21 08:01:26] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40001 steps (88 resets) in 972 ms. (41 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40001 steps (32 resets) in 1813 ms. (22 steps per ms) remains 1/1 properties
[2024-05-21 08:01:27] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 08:01:27] [INFO ] Invariant cache hit.
[2024-05-21 08:01:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/363 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/376 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/363 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/365 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/376 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/376 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 173 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 1220 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 171 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:01:28] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 08:01:28] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 08:01:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:01:38] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21971 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47252ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47273ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 69 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47523 ms. Remains : 125/128 places, 1225/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40009 steps (32 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 497866 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 497866 steps, saw 135926 distinct states, run finished after 3005 ms. (steps per millisecond=165 ) properties seen :0
[2024-05-21 08:02:18] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 08:02:18] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 08:02:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/355 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/355 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/370 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 46 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 46 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:02:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:02:19] [INFO ] Invariant cache hit.
[2024-05-21 08:02:20] [INFO ] Implicit Places using invariants in 372 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 375 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 87 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 511 ms. Remains : 123/125 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (88 resets) in 382 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40005 steps (32 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 500655 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 500655 steps, saw 136586 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :0
[2024-05-21 08:02:23] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 08:02:23] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 08:02:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/355 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/368 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/355 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 90 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:02:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:02:24] [INFO ] Invariant cache hit.
[2024-05-21 08:02:24] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 08:02:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:02:24] [INFO ] Invariant cache hit.
[2024-05-21 08:02:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:02:25] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-21 08:02:25] [INFO ] Redundant transitions in 83 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:02:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:02:25] [INFO ] Invariant cache hit.
[2024-05-21 08:02:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:02:34] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 65330ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66336 ms. Remains : 123/123 places, 1225/1225 transitions.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 10 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 08:03:31] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 08:03:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 08:03:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 08:03:39] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
SMT process timed out in 25221ms, After SMT, problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 25241ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:03:56] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 08:03:56] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 08:03:56] [INFO ] Implicit Places using invariants in 206 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25469 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-01 finished in 25732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 228 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:03:57] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-05-21 08:03:57] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 08:03:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:04:06] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 247/373 variables, 126/133 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 20/153 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21817 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47591ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47604ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:04:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 126 cols
[2024-05-21 08:04:44] [INFO ] Computed 8 invariants in 8 ms
[2024-05-21 08:04:44] [INFO ] Implicit Places using invariants in 279 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 64 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48184 ms. Remains : 125/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 181 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-02 finished in 48470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 08:04:45] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-05-21 08:04:45] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 08:04:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 08:04:55] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21825 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 48516ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 48532ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:05:33] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-05-21 08:05:33] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 08:05:34] [INFO ] Implicit Places using invariants in 348 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 354 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 78 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49046 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-04 finished in 49144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 117 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:05:34] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-05-21 08:05:34] [INFO ] Computed 6 invariants in 7 ms
[2024-05-21 08:05:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:05:42] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:06:09] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/373 variables, and 8 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 2/2 constraints]
After SMT, in 45292ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 45309ms
[2024-05-21 08:06:19] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 08:06:19] [INFO ] Invariant cache hit.
[2024-05-21 08:06:20] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-21 08:06:20] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 08:06:20] [INFO ] Invariant cache hit.
[2024-05-21 08:06:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:06:20] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [54, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 684 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1227/1228 transitions.
Applied a total of 0 rules in 117 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46231 ms. Remains : 124/128 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05
Product exploration explored 100000 steps with 3864 reset in 523 ms.
Product exploration explored 100000 steps with 3917 reset in 460 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 2434 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 462 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 143 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 455 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1227/1227 transitions.
Applied a total of 0 rules in 65 ms. Remains 124 /124 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:06:23] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 124 cols
[2024-05-21 08:06:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 08:06:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:06:32] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/370 variables, 123/129 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 25508ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 25522ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:06:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-05-21 08:06:48] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 08:06:48] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-21 08:06:48] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:06:48] [INFO ] Invariant cache hit.
[2024-05-21 08:06:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:06:49] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-21 08:06:49] [INFO ] Redundant transitions in 58 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1225/1227 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26454 ms. Remains : 124/124 places, 1225/1227 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 39 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 602 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4013 reset in 544 ms.
Product exploration explored 100000 steps with 4011 reset in 565 ms.
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 65 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:06:51] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:06:51] [INFO ] Invariant cache hit.
[2024-05-21 08:06:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:07:01] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:07:28] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45728ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45746ms
[2024-05-21 08:07:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:07:37] [INFO ] Invariant cache hit.
[2024-05-21 08:07:37] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 08:07:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:07:37] [INFO ] Invariant cache hit.
[2024-05-21 08:07:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:07:38] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-21 08:07:38] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:07:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:07:38] [INFO ] Invariant cache hit.
[2024-05-21 08:07:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:07:47] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:08:12] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30596 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65558ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65571ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111957 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 finished in 189615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 97 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-05-21 08:08:44] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-05-21 08:08:44] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 08:08:44] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-21 08:08:44] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:08:44] [INFO ] Invariant cache hit.
[2024-05-21 08:08:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:08:45] [INFO ] Implicit Places using invariants and state equation in 653 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 995 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 61 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1155 ms. Remains : 119/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06
Product exploration explored 100000 steps with 687 reset in 307 ms.
Product exploration explored 100000 steps with 681 reset in 313 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/119 stabilizing places and 202/1224 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 : []
Knowledge based reduction with 4 factoid took 163 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 68 ms :[p0, p0]
RANDOM walk for 628 steps (0 resets) in 8 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 110 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 60 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
[2024-05-21 08:08:46] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 119 cols
[2024-05-21 08:08:46] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 08:08:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:08:47] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-21 08:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:08:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:08:47] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-21 08:08:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:08:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 45 ms returned sat
[2024-05-21 08:08:47] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-21 08:08:48] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2024-05-21 08:08:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2024-05-21 08:08:48] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 131 transitions) in 78 ms.
[2024-05-21 08:08:48] [INFO ] Added : 12 causal constraints over 4 iterations in 236 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1224/1224 transitions.
Applied a total of 0 rules in 68 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-21 08:08:48] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:08:48] [INFO ] Invariant cache hit.
[2024-05-21 08:08:48] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 08:08:48] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:08:48] [INFO ] Invariant cache hit.
[2024-05-21 08:08:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:08:49] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-21 08:08:49] [INFO ] Redundant transitions in 17 ms returned []
Running 1221 sub problems to find dead transitions.
[2024-05-21 08:08:49] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:08:49] [INFO ] Invariant cache hit.
[2024-05-21 08:08:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 244/363 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
[2024-05-21 08:09:22] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 144 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (OVERLAPS) 244/363 variables, 119/124 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1219/1363 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 1363 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1221 constraints, Known Traps: 1/1 constraints]
After SMT, in 65375ms problems are : Problem set: 2 solved, 1219 unsolved
Search for dead transitions found 2 dead transitions in 65399ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/119 places, 1222/1224 transitions.
Applied a total of 0 rules in 82 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 08:09:54] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 66274 ms. Remains : 119/119 places, 1222/1224 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Detected a total of 104/119 stabilizing places and 200/1222 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 : []
Knowledge based reduction with 4 factoid took 119 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 87 ms :[p0, p0]
RANDOM walk for 539 steps (0 resets) in 7 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 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 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
[2024-05-21 08:09:55] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-05-21 08:09:55] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 08:09:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:09:55] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-21 08:09:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:09:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:09:56] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 08:09:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:09:56] [INFO ] [Nat]Added 20 Read/Feed constraints in 27 ms returned sat
[2024-05-21 08:09:56] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2024-05-21 08:09:56] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 2 ms to minimize.
[2024-05-21 08:09:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2024-05-21 08:09:56] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 41 ms.
[2024-05-21 08:09:56] [INFO ] Added : 12 causal constraints over 3 iterations in 219 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 113 ms :[p0, p0]
Product exploration explored 100000 steps with 683 reset in 353 ms.
Product exploration explored 100000 steps with 681 reset in 380 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 69 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 08:09:57] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 08:09:57] [INFO ] Invariant cache hit.
[2024-05-21 08:09:58] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 08:09:58] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 08:09:58] [INFO ] Invariant cache hit.
[2024-05-21 08:09:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:09:58] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-05-21 08:09:58] [INFO ] Redundant transitions in 13 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-05-21 08:09:58] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 08:09:58] [INFO ] Invariant cache hit.
[2024-05-21 08:09:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1219/1362 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 66121ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 66139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66873 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06 finished in 140794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 95 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-05-21 08:11:04] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-05-21 08:11:04] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 08:11:05] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 08:11:05] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:11:05] [INFO ] Invariant cache hit.
[2024-05-21 08:11:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:11:05] [INFO ] Implicit Places using invariants and state equation in 678 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 906 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 79 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1081 ms. Remains : 119/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08
Product exploration explored 100000 steps with 690 reset in 345 ms.
Product exploration explored 100000 steps with 692 reset in 292 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 541 steps (0 resets) in 7 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-21 08:11:06] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 119 cols
[2024-05-21 08:11:06] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 08:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:11:07] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-21 08:11:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:11:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:11:07] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-21 08:11:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:11:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 156 ms returned sat
[2024-05-21 08:11:07] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 131 transitions) in 54 ms.
[2024-05-21 08:11:07] [INFO ] Added : 10 causal constraints over 5 iterations in 187 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1224/1224 transitions.
Applied a total of 0 rules in 72 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-21 08:11:07] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:11:07] [INFO ] Invariant cache hit.
[2024-05-21 08:11:08] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 08:11:08] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:11:08] [INFO ] Invariant cache hit.
[2024-05-21 08:11:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:11:08] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2024-05-21 08:11:08] [INFO ] Redundant transitions in 17 ms returned []
Running 1221 sub problems to find dead transitions.
[2024-05-21 08:11:08] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:11:08] [INFO ] Invariant cache hit.
[2024-05-21 08:11:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 244/363 variables, 119/123 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/143 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
[2024-05-21 08:11:41] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 144 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 3 (OVERLAPS) 244/363 variables, 119/124 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/144 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1219/1363 constraints. Problems are: Problem set: 2 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 1363 constraints, problems are : Problem set: 2 solved, 1219 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1221 constraints, Known Traps: 1/1 constraints]
After SMT, in 65226ms problems are : Problem set: 2 solved, 1219 unsolved
Search for dead transitions found 2 dead transitions in 65240ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/119 places, 1222/1224 transitions.
Applied a total of 0 rules in 100 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 08:12:14] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 66372 ms. Remains : 119/119 places, 1222/1224 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 566 steps (0 resets) in 5 ms. (94 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-21 08:12:14] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
// Phase 1: matrix 242 rows 119 cols
[2024-05-21 08:12:14] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 08:12:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:12:15] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-21 08:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:12:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 08:12:15] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-21 08:12:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:12:15] [INFO ] [Nat]Added 20 Read/Feed constraints in 16 ms returned sat
[2024-05-21 08:12:15] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 131 transitions) in 32 ms.
[2024-05-21 08:12:15] [INFO ] Added : 11 causal constraints over 3 iterations in 181 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 687 reset in 401 ms.
Product exploration explored 100000 steps with 688 reset in 368 ms.
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 70 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2024-05-21 08:12:16] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 08:12:16] [INFO ] Invariant cache hit.
[2024-05-21 08:12:16] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 08:12:16] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 08:12:16] [INFO ] Invariant cache hit.
[2024-05-21 08:12:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:12:17] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2024-05-21 08:12:17] [INFO ] Redundant transitions in 18 ms returned []
Running 1219 sub problems to find dead transitions.
[2024-05-21 08:12:17] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2024-05-21 08:12:17] [INFO ] Invariant cache hit.
[2024-05-21 08:12:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1219/1362 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 65583ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 65598ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66457 ms. Remains : 119/119 places, 1222/1222 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 finished in 138027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 65 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:13:22] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 08:13:22] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:13:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:13:32] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47438ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47450ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:14:10] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 08:14:10] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 08:14:10] [INFO ] Implicit Places using invariants in 250 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 70 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47843 ms. Remains : 124/128 places, 1225/1228 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09
Product exploration explored 100000 steps with 456 reset in 625 ms.
Product exploration explored 100000 steps with 468 reset in 514 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 230 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 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 540 steps (0 resets) in 7 ms. (67 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 229 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 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 58 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:14:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-05-21 08:14:12] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 08:14:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:14:22] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20508 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46259ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46272ms
[2024-05-21 08:14:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:14:59] [INFO ] Invariant cache hit.
[2024-05-21 08:14:59] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-21 08:14:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:14:59] [INFO ] Invariant cache hit.
[2024-05-21 08:14:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:15:00] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2024-05-21 08:15:00] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:15:00] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:15:00] [INFO ] Invariant cache hit.
[2024-05-21 08:15:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:15:09] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 35846ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35875ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83231 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 239 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 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 865 steps (0 resets) in 11 ms. (72 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 343 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 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 480 reset in 710 ms.
Product exploration explored 100000 steps with 487 reset in 600 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 115 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:15:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:15:38] [INFO ] Invariant cache hit.
[2024-05-21 08:15:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:15:48] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20448 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46420ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46438ms
[2024-05-21 08:16:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:16:25] [INFO ] Invariant cache hit.
[2024-05-21 08:16:25] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 08:16:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:16:25] [INFO ] Invariant cache hit.
[2024-05-21 08:16:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:16:25] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-05-21 08:16:25] [INFO ] Redundant transitions in 26 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:16:25] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:16:25] [INFO ] Invariant cache hit.
[2024-05-21 08:16:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:16:36] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:17:01] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
SMT process timed out in 35562ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82940 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09 finished in 218748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((G(F(p1))||(p2&&F(p1))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 84 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 08:17:01] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 08:17:01] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 08:17:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 08:17:11] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 20898 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 46686ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 46704ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:17:48] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 08:17:48] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 08:17:48] [INFO ] Implicit Places using invariants in 307 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47180 ms. Remains : 124/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10
Product exploration explored 100000 steps with 852 reset in 635 ms.
Product exploration explored 100000 steps with 909 reset in 420 ms.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/124 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 622 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (88 resets) in 473 ms. (84 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40010 steps (32 resets) in 437 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 1052 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (28 resets) in 622 ms. (64 steps per ms) remains 3/3 properties
[2024-05-21 08:17:51] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-05-21 08:17:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 08:17:51] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 152/156 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/356 variables, 106/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 20/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/358 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/370 variables, 12/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 1 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 151 constraints, problems are : Problem set: 1 solved, 2 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 304 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 71 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:17:53] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:17:53] [INFO ] Invariant cache hit.
[2024-05-21 08:17:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:18:02] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46124ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46222 ms. Remains : 124/124 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 1012 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 420 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (28 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 372785 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 2
Probabilistic random walk after 372785 steps, saw 102018 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-21 08:18:42] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:18:42] [INFO ] Invariant cache hit.
[2024-05-21 08:18:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/370 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 977ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 57 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-05-21 08:18:44] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:18:44] [INFO ] Invariant cache hit.
[2024-05-21 08:18:44] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-21 08:18:44] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:18:44] [INFO ] Invariant cache hit.
[2024-05-21 08:18:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:18:45] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2024-05-21 08:18:45] [INFO ] Redundant transitions in 17 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:18:45] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:18:45] [INFO ] Invariant cache hit.
[2024-05-21 08:18:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:18:54] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
SMT process timed out in 35646ms, After SMT, problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 35661ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36600 ms. Remains : 124/124 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 124 transition count 246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 122 transition count 244
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 122 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 120 transition count 242
Applied a total of 988 rules in 29 ms. Remains 120 /124 variables (removed 4) and now considering 242/1226 (removed 984) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 242 rows 120 cols
[2024-05-21 08:19:20] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 08:19:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:19:21] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 08:19:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 08:19:21] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 08:19:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 08:19:21] [INFO ] After 42ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 08:19:21] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 08:19:21] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 566 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 21 factoid took 1222 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 85 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:19:22] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-05-21 08:19:22] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:19:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:19:31] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20370 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45283ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45300ms
[2024-05-21 08:20:08] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:20:08] [INFO ] Invariant cache hit.
[2024-05-21 08:20:08] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 08:20:08] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:20:08] [INFO ] Invariant cache hit.
[2024-05-21 08:20:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:20:08] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2024-05-21 08:20:09] [INFO ] Redundant transitions in 16 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:20:09] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:20:09] [INFO ] Invariant cache hit.
[2024-05-21 08:20:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:20:17] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65225ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111437 ms. Remains : 124/124 places, 1226/1226 transitions.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/124 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 730 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (88 resets) in 1186 ms. (33 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40017 steps (32 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
[2024-05-21 08:21:15] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:21:15] [INFO ] Invariant cache hit.
[2024-05-21 08:21:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 152/156 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 200/356 variables, 106/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 20/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/358 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/370 variables, 12/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 1 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/355 variables, 106/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 150 constraints, problems are : Problem set: 1 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 1225
Applied a total of 2 rules in 64 ms. Remains 123 /124 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:21:16] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 08:21:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 08:21:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:21:25] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20461 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45998ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46082 ms. Remains : 123/124 places, 1225/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40005 steps (32 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 513327 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 513327 steps, saw 140028 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-21 08:22:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:22:05] [INFO ] Invariant cache hit.
[2024-05-21 08:22:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/355 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/368 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/355 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 202 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 89 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 08:22:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:22:06] [INFO ] Invariant cache hit.
[2024-05-21 08:22:06] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-21 08:22:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:22:06] [INFO ] Invariant cache hit.
[2024-05-21 08:22:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:22:07] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-05-21 08:22:07] [INFO ] Redundant transitions in 17 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:22:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:22:07] [INFO ] Invariant cache hit.
[2024-05-21 08:22:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:22:16] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1371 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 65638ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65653ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66497 ms. Remains : 123/123 places, 1225/1225 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 17 factoid took 1634 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 874 reset in 463 ms.
Product exploration explored 100000 steps with 859 reset in 435 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 54 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:23:15] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-05-21 08:23:15] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 08:23:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:23:25] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/370 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45401ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45418ms
[2024-05-21 08:24:01] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:24:01] [INFO ] Invariant cache hit.
[2024-05-21 08:24:01] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 08:24:01] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:24:01] [INFO ] Invariant cache hit.
[2024-05-21 08:24:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:24:02] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2024-05-21 08:24:02] [INFO ] Redundant transitions in 13 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:24:02] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:24:02] [INFO ] Invariant cache hit.
[2024-05-21 08:24:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:24:11] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 150 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1373 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1373 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 65746ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65759ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112020 ms. Remains : 124/124 places, 1226/1226 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 finished in 486364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||F(p1)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 10 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 08:25:08] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-05-21 08:25:08] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 08:25:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 08:25:17] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 45327ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 45346ms
[2024-05-21 08:25:53] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 08:25:53] [INFO ] Invariant cache hit.
[2024-05-21 08:25:53] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 08:25:53] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 08:25:53] [INFO ] Invariant cache hit.
[2024-05-21 08:25:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:25:54] [INFO ] Implicit Places using invariants and state equation in 599 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 800 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46164 ms. Remains : 125/128 places, 1228/1228 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 1509 reset in 322 ms.
Product exploration explored 100000 steps with 1487 reset in 356 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2436 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 257 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 262 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 397 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1228/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 08:25:56] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 125 cols
[2024-05-21 08:25:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 08:25:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 08:26:05] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/372 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 1270 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21475 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1120/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47288ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47304ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:26:43] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-05-21 08:26:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 08:26:43] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-21 08:26:43] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:26:43] [INFO ] Invariant cache hit.
[2024-05-21 08:26:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:26:44] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/125 places, 1226/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48068 ms. Remains : 125/125 places, 1226/1228 transitions.
Computed a total of 108 stabilizing places and 202 stable transitions
Graph (complete) has 2432 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 335 steps (0 resets) in 8 ms. (37 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1513 reset in 414 ms.
Product exploration explored 100000 steps with 1530 reset in 408 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1226/1226 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 125 transition count 1226
Deduced a syphon composed of 1 places in 14 ms
Applied a total of 1 rules in 94 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:26:46] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-05-21 08:26:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 08:26:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:26:56] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:27:24] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-21 08:27:25] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/371 variables, and 9 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 3/3 constraints]
After SMT, in 46137ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46150ms
[2024-05-21 08:27:32] [INFO ] Redundant transitions in 12 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:27:32] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:27:32] [INFO ] Invariant cache hit.
[2024-05-21 08:27:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:27:44] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/371 variables, and 7 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:28:21] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 3 ms to minimize.
[2024-05-21 08:28:22] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/371 variables, and 9 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 3/3 constraints]
After SMT, in 65818ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65830ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 1226/1226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112111 ms. Remains : 125/125 places, 1226/1226 transitions.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:28:38] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 125 cols
[2024-05-21 08:28:38] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 08:28:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:28:48] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:29:18] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2024-05-21 08:29:19] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/371 variables, and 9 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 3/3 constraints]
After SMT, in 45939ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45953ms
[2024-05-21 08:29:24] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:29:24] [INFO ] Invariant cache hit.
[2024-05-21 08:29:26] [INFO ] Implicit Places using invariants in 2209 ms returned []
[2024-05-21 08:29:26] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:29:26] [INFO ] Invariant cache hit.
[2024-05-21 08:29:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:29:27] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 2604 ms to find 0 implicit places.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:29:27] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:29:27] [INFO ] Invariant cache hit.
[2024-05-21 08:29:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:29:36] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:30:01] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/371 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 6 (OVERLAPS) 246/371 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1376 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30393 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
After SMT, in 65750ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65763ms
Finished structural reductions in LTL mode , in 1 iterations and 114331 ms. Remains : 125/125 places, 1226/1226 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 finished in 325082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(!p1)))&&F(p2)))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 51 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 08:30:33] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-05-21 08:30:33] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 08:30:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 08:30:43] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21515 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47386ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47398ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:31:20] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 127 cols
[2024-05-21 08:31:20] [INFO ] Computed 8 invariants in 27 ms
[2024-05-21 08:31:20] [INFO ] Implicit Places using invariants in 335 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 350 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 48 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47851 ms. Remains : 125/128 places, 1226/1228 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (NOT p2) p1), p1, (AND p1 (NOT p0)), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-12 finished in 48054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 68 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:31:21] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 08:31:21] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 08:31:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:31:30] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
SMT process timed out in 25830ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 25843ms
[2024-05-21 08:31:47] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 08:31:47] [INFO ] Invariant cache hit.
[2024-05-21 08:31:47] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 08:31:47] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 08:31:47] [INFO ] Invariant cache hit.
[2024-05-21 08:31:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:31:48] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1962 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/128 places, 1227/1228 transitions.
Applied a total of 0 rules in 73 ms. Remains 123 /123 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27949 ms. Remains : 123/128 places, 1227/1228 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-13 finished in 28069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 67 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2024-05-21 08:31:49] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 121 cols
[2024-05-21 08:31:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 08:31:49] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 08:31:49] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2024-05-21 08:31:49] [INFO ] Invariant cache hit.
[2024-05-21 08:31:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:31:49] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 751 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 72 ms. Remains 120 /120 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 891 ms. Remains : 120/128 places, 1224/1228 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15
Product exploration explored 100000 steps with 14413 reset in 508 ms.
Product exploration explored 100000 steps with 14350 reset in 478 ms.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Detected a total of 105/120 stabilizing places and 202/1224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-21 08:31:51] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
// Phase 1: matrix 244 rows 120 cols
[2024-05-21 08:31:51] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 08:31:52] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 08:31:52] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-21 08:31:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:31:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 08:31:52] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 08:31:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:31:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2024-05-21 08:31:53] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2024-05-21 08:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 183 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-15 finished in 4163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((G(F(p1))||(p2&&F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||F(p1)))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 1227
Applied a total of 3 rules in 42 ms. Remains 126 /128 variables (removed 2) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 08:31:54] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2024-05-21 08:31:54] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 08:31:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 08:32:03] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/373 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 5 (OVERLAPS) 247/373 variables, 126/133 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 20/153 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21592 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47347ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47368ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 08:32:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 126 cols
[2024-05-21 08:32:41] [INFO ] Computed 8 invariants in 12 ms
[2024-05-21 08:32:42] [INFO ] Implicit Places using invariants in 290 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 305 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 47731 ms. Remains : 124/128 places, 1225/1228 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11
Product exploration explored 100000 steps with 1704 reset in 418 ms.
Product exploration explored 100000 steps with 1765 reset in 480 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 327 steps (0 resets) in 7 ms. (40 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 455 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:32:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 124 cols
[2024-05-21 08:32:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 08:32:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:32:54] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:33:21] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45156ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45171ms
[2024-05-21 08:33:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:33:29] [INFO ] Invariant cache hit.
[2024-05-21 08:33:29] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-21 08:33:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:33:29] [INFO ] Invariant cache hit.
[2024-05-21 08:33:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:33:30] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:33:30] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:33:30] [INFO ] Invariant cache hit.
[2024-05-21 08:33:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:33:39] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:34:02] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30410 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65311ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65323ms
Finished structural reductions in LTL mode , in 1 iterations and 111477 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Graph (complete) has 2430 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 319 steps (0 resets) in 9 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1720 reset in 317 ms.
Product exploration explored 100000 steps with 1733 reset in 451 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 70 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:34:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:34:37] [INFO ] Invariant cache hit.
[2024-05-21 08:34:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:34:48] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:35:16] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 46683ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46703ms
[2024-05-21 08:35:24] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:35:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:35:24] [INFO ] Invariant cache hit.
[2024-05-21 08:35:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:35:34] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:36:13] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65461ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112271 ms. Remains : 124/124 places, 1225/1225 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:36:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:36:29] [INFO ] Invariant cache hit.
[2024-05-21 08:36:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:36:39] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:37:06] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 45427ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45439ms
[2024-05-21 08:37:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:37:15] [INFO ] Invariant cache hit.
[2024-05-21 08:37:15] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 08:37:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:37:15] [INFO ] Invariant cache hit.
[2024-05-21 08:37:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:37:15] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:37:15] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 08:37:15] [INFO ] Invariant cache hit.
[2024-05-21 08:37:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:37:25] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:37:50] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (OVERLAPS) 245/369 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30276 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 65794ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 65807ms
Finished structural reductions in LTL mode , in 1 iterations and 111822 ms. Remains : 124/124 places, 1225/1225 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 finished in 387821 ms.
[2024-05-21 08:38:21] [INFO ] Flatten gal took : 88 ms
[2024-05-21 08:38:21] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 08:38:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1228 transitions and 9210 arcs took 11 ms.
Total runtime 2265695 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V50P50N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 128
TRANSITIONS: 1228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.008s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.002s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2734
MODEL NAME: /home/mcc/execution/418/model
128 places, 1228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-LTLCardinality-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716281499601

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-V50P50N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-COL-V50P50N10, 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 r047-tajo-171620397500091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;