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.r472-tajo-171620398600011.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 ltsminxred
Input is BridgeAndVehicles-COL-V10P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398600011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 01:17 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 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 38K 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-V10P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717217820125

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:01] [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-06-01 04:57:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 661 ms
[2024-06-01 04:57:02] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 04:57:02] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 04:57:02] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04 FALSE 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.5 ms
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 2552 ms. (15 steps per ms) remains 4/25 properties
BEST_FIRST walk for 40000 steps (8 resets) in 830 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 403 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:03] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/12 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 3 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 3 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 94 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 04:57:04] [INFO ] Flatten gal took : 14 ms
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:04] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:04] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 23 ms.
[2024-06-01 04:57:04] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 12 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2024-06-01 04:57:04] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-06-01 04:57:04] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 04:57:04] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 04:57:05] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 10 ms to minimize.
[2024-06-01 04:57:05] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
[2024-06-01 04:57:05] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/8 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 80 constraints, problems are : Problem set: 22 solved, 263 unsolved in 4656 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/8 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 263/343 constraints. Problems are: Problem set: 22 solved, 263 unsolved
[2024-06-01 04:57:13] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 344 constraints, problems are : Problem set: 22 solved, 263 unsolved in 10657 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 263/285 constraints, Known Traps: 4/4 constraints]
After SMT, in 15873ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 15884ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
[2024-06-01 04:57:20] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-06-01 04:57:20] [INFO ] Computed 9 invariants in 10 ms
[2024-06-01 04:57:20] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 04:57:20] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:57:20] [INFO ] Invariant cache hit.
[2024-06-01 04:57:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:57:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/48 places, 266/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16165 ms. Remains : 48/48 places, 266/288 transitions.
Support contains 12 out of 48 places after structural reductions.
[2024-06-01 04:57:20] [INFO ] Flatten gal took : 23 ms
[2024-06-01 04:57:20] [INFO ] Flatten gal took : 20 ms
[2024-06-01 04:57:20] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (441 resets) in 547 ms. (72 steps per ms) remains 1/19 properties
BEST_FIRST walk for 723 steps (0 resets) in 9 ms. (72 steps per ms) remains 0/1 properties
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 42 stable transitions
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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))||G(!p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.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 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 264
Applied a total of 6 rules in 34 ms. Remains 43 /48 variables (removed 5) and now considering 264/266 (removed 2) transitions.
[2024-06-01 04:57:20] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
// Phase 1: matrix 84 rows 43 cols
[2024-06-01 04:57:20] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 04:57:21] [INFO ] Implicit Places using invariants in 76 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 264/266 transitions.
Applied a total of 0 rules in 18 ms. Remains 41 /41 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 41/48 places, 264/266 transitions.
Stuttering acceptance computed with spot in 192 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
Product exploration explored 100000 steps with 7830 reset in 275 ms.
Product exploration explored 100000 steps with 7743 reset in 198 ms.
Computed a total of 24 stabilizing places and 40 stable transitions
Computed a total of 24 stabilizing places and 40 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[false, (NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[false, (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 264/264 transitions.
Applied a total of 0 rules in 10 ms. Remains 41 /41 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 04:57:22] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
// Phase 1: matrix 84 rows 41 cols
[2024-06-01 04:57:22] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 04:57:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 04:57:22] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 04:57:22] [INFO ] Invariant cache hit.
[2024-06-01 04:57:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:57:22] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-01 04:57:22] [INFO ] Redundant transitions in 9 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 04:57:22] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 04:57:22] [INFO ] Invariant cache hit.
[2024-06-01 04:57:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 04:57:23] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/125 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 04:57:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 67 constraints, problems are : Problem set: 0 solved, 261 unsolved in 5168 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/125 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 261/328 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 328 constraints, problems are : Problem set: 0 solved, 261 unsolved in 6692 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 12271ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 12275ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12480 ms. Remains : 41/41 places, 264/264 transitions.
Computed a total of 24 stabilizing places and 40 stable transitions
Computed a total of 24 stabilizing places and 40 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[false, (NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[false, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7850 reset in 173 ms.
Product exploration explored 100000 steps with 7776 reset in 167 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 264/264 transitions.
Applied a total of 0 rules in 11 ms. Remains 41 /41 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 04:57:36] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 04:57:36] [INFO ] Invariant cache hit.
[2024-06-01 04:57:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 04:57:36] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 04:57:36] [INFO ] Invariant cache hit.
[2024-06-01 04:57:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:57:36] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-01 04:57:36] [INFO ] Redundant transitions in 3 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 04:57:36] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 04:57:36] [INFO ] Invariant cache hit.
[2024-06-01 04:57:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 04:57:37] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/125 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 04:57:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 67 constraints, problems are : Problem set: 0 solved, 261 unsolved in 4868 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/125 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 261/328 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 328 constraints, problems are : Problem set: 0 solved, 261 unsolved in 6393 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 11573ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 11577ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11834 ms. Remains : 41/41 places, 264/264 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 finished in 27024 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(F(p0))||G((p1&&X(p2)))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:57:47] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-01 04:57:47] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 04:57:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:57:48] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:57:50] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:57:51] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 78 constraints, problems are : Problem set: 0 solved, 263 unsolved in 6704 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 6659 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 13659ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13662ms
[2024-06-01 04:58:01] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:58:01] [INFO ] Invariant cache hit.
[2024-06-01 04:58:01] [INFO ] Implicit Places using invariants in 106 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13776 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05
Stuttering criterion allowed to conclude after 93 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 finished in 14170 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 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:58:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:58:02] [INFO ] Invariant cache hit.
[2024-06-01 04:58:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:03] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:04] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:06] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 78 constraints, problems are : Problem set: 0 solved, 263 unsolved in 6461 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 8386 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15228ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15232ms
[2024-06-01 04:58:17] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:58:17] [INFO ] Invariant cache hit.
[2024-06-01 04:58:17] [INFO ] Implicit Places using invariants in 79 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15347 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07 finished in 15453 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(F(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:58:17] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 04:58:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 04:58:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:18] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 04:58:19] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 76 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4653 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 7761 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 12714ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 12718ms
[2024-06-01 04:58:30] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:58:30] [INFO ] Invariant cache hit.
[2024-06-01 04:58:30] [INFO ] Implicit Places using invariants in 109 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12836 ms. Remains : 44/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08
Stuttering criterion allowed to conclude after 724 steps with 19 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 finished in 12940 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((p1&&(G(p2)||X(p3))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:58:30] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-01 04:58:30] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 04:58:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:31] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:32] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5489 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:39] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9898 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15718ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15721ms
[2024-06-01 04:58:46] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:58:46] [INFO ] Invariant cache hit.
[2024-06-01 04:58:46] [INFO ] Implicit Places using invariants in 70 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15798 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
Product exploration explored 100000 steps with 12210 reset in 258 ms.
Product exploration explored 100000 steps with 12238 reset in 287 ms.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 59 factoid took 1586 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 33 to 28
RANDOM walk for 40000 steps (442 resets) in 626 ms. (63 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40003 steps (135 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (139 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (117 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (132 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
[2024-06-01 04:58:49] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 04:58:49] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 04:58:49] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:58:50] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1408ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 201 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 14 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:58:51] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:58:51] [INFO ] Invariant cache hit.
[2024-06-01 04:58:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:52] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:53] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:58:59] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10137 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15533ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15536ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15563 ms. Remains : 46/46 places, 266/266 transitions.
RANDOM walk for 40000 steps (444 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (138 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (117 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40006 steps (130 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (136 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 215351 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 6
Probabilistic random walk after 215351 steps, saw 54177 distinct states, run finished after 3006 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 04:59:10] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:10] [INFO ] Invariant cache hit.
[2024-06-01 04:59:10] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 299 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 46/46 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-01 04:59:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 04:59:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:59:11] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-01 04:59:11] [INFO ] Redundant transitions in 3 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-01 04:59:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:11] [INFO ] Invariant cache hit.
[2024-06-01 04:59:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:13] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4888 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:19] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9544 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14754ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14756ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15056 ms. Remains : 46/46 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 46 transition count 86
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 184 place count 44 transition count 84
Applied a total of 184 rules in 11 ms. Remains 44 /46 variables (removed 2) and now considering 84/266 (removed 182) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 84 rows 44 cols
[2024-06-01 04:59:26] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 04:59:26] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 04:59:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 04:59:26] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 18 ms returned sat
[2024-06-01 04:59:26] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 04:59:26] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 04:59:26] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 59 factoid took 5060 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:59:32] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 04:59:32] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 04:59:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:34] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5312 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 7597 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 13283ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13287ms
[2024-06-01 04:59:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:45] [INFO ] Invariant cache hit.
[2024-06-01 04:59:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 04:59:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:45] [INFO ] Invariant cache hit.
[2024-06-01 04:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:59:45] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-01 04:59:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 04:59:45] [INFO ] Invariant cache hit.
[2024-06-01 04:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:46] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:47] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4805 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 04:59:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10182 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15362ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15366ms
Finished structural reductions in LTL mode , in 1 iterations and 28862 ms. Remains : 46/46 places, 266/266 transitions.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 59 factoid took 1442 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 33 to 28
RANDOM walk for 40000 steps (444 resets) in 355 ms. (112 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40004 steps (136 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (140 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (117 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (125 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (131 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (136 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
[2024-06-01 05:00:03] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:03] [INFO ] Invariant cache hit.
[2024-06-01 05:00:03] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:00:04] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:00:04] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:04] [INFO ] Invariant cache hit.
[2024-06-01 05:00:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:05] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:06] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4608 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9794 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14670ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14678 ms. Remains : 46/46 places, 266/266 transitions.
RANDOM walk for 40000 steps (443 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (138 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 350620 steps, run timeout after 3011 ms. (steps per millisecond=116 ) properties seen :0 out of 6
Probabilistic random walk after 350620 steps, saw 86876 distinct states, run finished after 3011 ms. (steps per millisecond=116 ) properties seen :0
[2024-06-01 05:00:22] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:22] [INFO ] Invariant cache hit.
[2024-06-01 05:00:22] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:00:23] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 761ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 347 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 12 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 46/46 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-01 05:00:23] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:23] [INFO ] Invariant cache hit.
[2024-06-01 05:00:23] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 05:00:24] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:24] [INFO ] Invariant cache hit.
[2024-06-01 05:00:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:00:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-01 05:00:24] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-01 05:00:24] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:24] [INFO ] Invariant cache hit.
[2024-06-01 05:00:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:24] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:26] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4689 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:32] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10343 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15343ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15605 ms. Remains : 46/46 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 46 transition count 86
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 184 place count 44 transition count 84
Applied a total of 184 rules in 7 ms. Remains 44 /46 variables (removed 2) and now considering 84/266 (removed 182) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 84 rows 44 cols
[2024-06-01 05:00:39] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:00:39] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 05:00:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:39] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:00:39] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 05:00:39] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 05:00:39] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 268 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 59 factoid took 4614 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 12270 reset in 225 ms.
Product exploration explored 100000 steps with 12210 reset in 311 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:00:46] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 05:00:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:00:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:47] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:00:48] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 8140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 13085ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13088ms
[2024-06-01 05:00:59] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 05:00:59] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:00:59] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:00:59] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:01:00] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:01:01] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:01:07] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9541 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15000ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15004ms
Finished structural reductions in LTL mode , in 1 iterations and 28368 ms. Remains : 46/46 places, 266/266 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 finished in 164225 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&&G(F((p1 U (p2||G(p1))))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:01:14] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-01 05:01:14] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 05:01:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:01:15] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:01:16] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4537 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:01:22] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9232 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14086ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14089ms
[2024-06-01 05:01:28] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:01:28] [INFO ] Invariant cache hit.
[2024-06-01 05:01:28] [INFO ] Implicit Places using invariants in 102 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14225 ms. Remains : 45/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11 finished in 14443 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(F(p0))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 4 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:01:29] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-01 05:01:29] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 05:01:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:01:30] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 3261 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:01:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8329 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11990ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11994ms
[2024-06-01 05:01:41] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:01:41] [INFO ] Invariant cache hit.
[2024-06-01 05:01:41] [INFO ] Implicit Places using invariants in 76 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 265/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12081 ms. Remains : 44/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
Product exploration explored 100000 steps with 4715 reset in 263 ms.
Product exploration explored 100000 steps with 4756 reset in 243 ms.
Computed a total of 27 stabilizing places and 41 stable transitions
Computed a total of 27 stabilizing places and 41 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 265/265 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:01:42] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 44 cols
[2024-06-01 05:01:42] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:01:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:01:43] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:01:44] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 72 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4587 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 262/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 334 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11160ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11162ms
[2024-06-01 05:01:53] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:01:53] [INFO ] Invariant cache hit.
[2024-06-01 05:01:53] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 05:01:53] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:01:53] [INFO ] Invariant cache hit.
[2024-06-01 05:01:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:01:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:01:53] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:01:53] [INFO ] Invariant cache hit.
[2024-06-01 05:01:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:01:54] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 71 constraints, problems are : Problem set: 0 solved, 262 unsolved in 3761 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 262/333 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 333 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
After SMT, in 11105ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11108ms
Finished structural reductions in LTL mode , in 1 iterations and 22470 ms. Remains : 44/44 places, 265/265 transitions.
Computed a total of 27 stabilizing places and 41 stable transitions
Computed a total of 27 stabilizing places and 41 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5066 reset in 227 ms.
Product exploration explored 100000 steps with 4903 reset in 240 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 265/265 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 17 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:02:06] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 44 cols
[2024-06-01 05:02:06] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 05:02:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:02:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Problem TDEAD10 is UNSAT
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 1 solved, 261 unsolved
[2024-06-01 05:02:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 72 constraints, problems are : Problem set: 1 solved, 261 unsolved in 4032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 261/333 constraints. Problems are: Problem set: 1 solved, 261 unsolved
[2024-06-01 05:02:12] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/334 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 334 constraints, problems are : Problem set: 1 solved, 261 unsolved in 9182 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 13590ms problems are : Problem set: 1 solved, 261 unsolved
Search for dead transitions found 1 dead transitions in 13595ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-06-01 05:02:19] [INFO ] Redundant transitions in 1 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 44/44 places, 264/265 transitions.
Graph (complete) has 610 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 19 ms. Remains 42 /44 variables (removed 2) and now considering 264/264 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/44 places, 264/265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13638 ms. Remains : 42/44 places, 264/265 transitions.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 265/265 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:02:19] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 44 cols
[2024-06-01 05:02:19] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:02:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:02:20] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:02:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 72 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 262/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 334 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5588 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 10773ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 10777ms
[2024-06-01 05:02:30] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:02:30] [INFO ] Invariant cache hit.
[2024-06-01 05:02:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 05:02:30] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:02:30] [INFO ] Invariant cache hit.
[2024-06-01 05:02:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:02:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:02:30] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:02:30] [INFO ] Invariant cache hit.
[2024-06-01 05:02:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:02:31] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 71 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/129 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 262/333 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 333 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6209 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints]
After SMT, in 10596ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 10600ms
Finished structural reductions in LTL mode , in 1 iterations and 21531 ms. Remains : 44/44 places, 265/265 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 finished in 72315 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&&G((p1||X(p2))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:02:41] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-06-01 05:02:41] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 05:02:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:02:42] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:02:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:02:43] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/134 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 80 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4904 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/134 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 263/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:02:49] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 344 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10959 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 4/4 constraints]
After SMT, in 16107ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 16111ms
[2024-06-01 05:02:57] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:02:57] [INFO ] Invariant cache hit.
[2024-06-01 05:02:57] [INFO ] Implicit Places using invariants in 77 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16193 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 finished in 16372 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 U (G(p0)||(p0&&G((p1 U X(p2))))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 1 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:02:57] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-01 05:02:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 05:02:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:02:58] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:00] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:06] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9427 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14882ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14884ms
[2024-06-01 05:03:12] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:12] [INFO ] Invariant cache hit.
[2024-06-01 05:03:12] [INFO ] Implicit Places using invariants in 89 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14980 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
Product exploration explored 100000 steps with 3123 reset in 300 ms.
Product exploration explored 100000 steps with 3249 reset in 273 ms.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 966 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 40000 steps (442 resets) in 251 ms. (158 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (154 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (158 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40006 steps (158 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
[2024-06-01 05:03:15] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 05:03:15] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:03:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 2/132 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/46 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) p2)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 34 factoid took 2317 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 05:03:17] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:17] [INFO ] Invariant cache hit.
[2024-06-01 05:03:17] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:03:17] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 05:03:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:03:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:17] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:03:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:03:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:03:18] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 11 ms.
[2024-06-01 05:03:18] [INFO ] Added : 11 causal constraints over 3 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 05:03:18] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:18] [INFO ] Invariant cache hit.
[2024-06-01 05:03:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:03:18] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:03:18] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 05:03:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:03:18] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:03:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:03:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:03:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 9 ms returned sat
[2024-06-01 05:03:18] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-06-01 05:03:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2024-06-01 05:03:18] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 12 ms.
[2024-06-01 05:03:18] [INFO ] Added : 14 causal constraints over 4 iterations in 54 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:03:18] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:18] [INFO ] Invariant cache hit.
[2024-06-01 05:03:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:19] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:20] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4832 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:26] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9799 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14910ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14914ms
[2024-06-01 05:03:33] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:33] [INFO ] Invariant cache hit.
[2024-06-01 05:03:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 05:03:33] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:33] [INFO ] Invariant cache hit.
[2024-06-01 05:03:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:03:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:03:33] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:33] [INFO ] Invariant cache hit.
[2024-06-01 05:03:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:34] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4603 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9747 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14737ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14741ms
Finished structural reductions in LTL mode , in 1 iterations and 29870 ms. Remains : 46/46 places, 266/266 transitions.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 809 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 493 steps (4 resets) in 5 ms. (82 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 2194 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 05:03:52] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:52] [INFO ] Invariant cache hit.
[2024-06-01 05:03:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:03:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:03:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:03:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:03:52] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 14 ms.
[2024-06-01 05:03:52] [INFO ] Added : 11 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 05:03:52] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:52] [INFO ] Invariant cache hit.
[2024-06-01 05:03:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 05:03:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 05:03:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:03:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:03:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 9 ms returned sat
[2024-06-01 05:03:52] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:03:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 05:03:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2024-06-01 05:03:52] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 22 ms.
[2024-06-01 05:03:53] [INFO ] Added : 14 causal constraints over 4 iterations in 104 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3212 reset in 296 ms.
Product exploration explored 100000 steps with 3232 reset in 283 ms.
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:03:53] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:03:53] [INFO ] Invariant cache hit.
[2024-06-01 05:03:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:54] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:03:56] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4927 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:01] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9692 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15008ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15016ms
[2024-06-01 05:04:08] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:04:08] [INFO ] Invariant cache hit.
[2024-06-01 05:04:09] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 05:04:09] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:04:09] [INFO ] Invariant cache hit.
[2024-06-01 05:04:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:04:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:04:09] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:04:09] [INFO ] Invariant cache hit.
[2024-06-01 05:04:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:10] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:11] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4631 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:17] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10687 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15648ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15652ms
Finished structural reductions in LTL mode , in 1 iterations and 30891 ms. Remains : 46/46 places, 266/266 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 finished in 87050 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))||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(p0)||F((p1&&(G(p2)||X(p3))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
Stuttering acceptance computed with spot in 441 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:04:25] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-01 05:04:25] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 05:04:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:26] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:27] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 341 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9372 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14613ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14617ms
[2024-06-01 05:04:40] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:04:40] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [INFO ] Implicit Places using invariants in 66 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/48 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 14699 ms. Remains : 46/48 places, 266/266 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
Product exploration explored 100000 steps with 12225 reset in 238 ms.
Product exploration explored 100000 steps with 12194 reset in 210 ms.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 59 factoid took 1372 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 33 to 28
RANDOM walk for 40002 steps (442 resets) in 450 ms. (88 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40004 steps (136 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (139 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (117 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (131 resets) in 108 ms. (366 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (137 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
[2024-06-01 05:04:43] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 05:04:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:04:43] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:04:43] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 754ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 482 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:04:44] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:04:44] [INFO ] Invariant cache hit.
[2024-06-01 05:04:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:45] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:46] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:04:51] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9928 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14833ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14836ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14843 ms. Remains : 46/46 places, 266/266 transitions.
RANDOM walk for 40001 steps (443 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (135 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (139 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (124 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (135 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 215609 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 6
Probabilistic random walk after 215609 steps, saw 54252 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 05:05:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:02] [INFO ] Invariant cache hit.
[2024-06-01 05:05:02] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:05:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 424 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 46/46 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-01 05:05:03] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:03] [INFO ] Invariant cache hit.
[2024-06-01 05:05:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 05:05:03] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:03] [INFO ] Invariant cache hit.
[2024-06-01 05:05:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:05:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-01 05:05:03] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-01 05:05:03] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:03] [INFO ] Invariant cache hit.
[2024-06-01 05:05:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:06] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4471 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:11] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9965 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14744ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14936 ms. Remains : 46/46 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 46 transition count 86
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 184 place count 44 transition count 84
Applied a total of 184 rules in 6 ms. Remains 44 /46 variables (removed 2) and now considering 84/266 (removed 182) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 84 rows 44 cols
[2024-06-01 05:05:18] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:05:18] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 05:05:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:18] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:05:18] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 05:05:18] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 05:05:19] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 296 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 59 factoid took 4672 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 441 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:05:24] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 05:05:24] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:05:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:25] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:26] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4477 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 6960 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 11789ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 11796ms
[2024-06-01 05:05:36] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:36] [INFO ] Invariant cache hit.
[2024-06-01 05:05:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 05:05:36] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:36] [INFO ] Invariant cache hit.
[2024-06-01 05:05:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:05:36] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:05:36] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:36] [INFO ] Invariant cache hit.
[2024-06-01 05:05:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:37] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:38] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4639 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:44] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10457 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15437ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15440ms
Finished structural reductions in LTL mode , in 1 iterations and 27445 ms. Remains : 46/46 places, 266/266 transitions.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 59 factoid took 1736 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 33 to 28
RANDOM walk for 40000 steps (442 resets) in 1098 ms. (36 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40003 steps (135 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (140 resets) in 186 ms. (213 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (117 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (124 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (132 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
[2024-06-01 05:05:55] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:55] [INFO ] Invariant cache hit.
[2024-06-01 05:05:55] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:05:55] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 363 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:05:56] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:05:56] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:56] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:05:58] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4399 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10701 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 15333ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15341 ms. Remains : 46/46 places, 266/266 transitions.
RANDOM walk for 40000 steps (440 resets) in 473 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (140 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (117 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (124 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (131 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (136 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 363218 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 6
Probabilistic random walk after 363218 steps, saw 89980 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 05:06:15] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:15] [INFO ] Invariant cache hit.
[2024-06-01 05:06:15] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 11/132 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 6 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/70 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 49/119 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/121 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/132 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:06:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 6 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 392 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 46/46 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-01 05:06:15] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:15] [INFO ] Invariant cache hit.
[2024-06-01 05:06:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 05:06:16] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:16] [INFO ] Invariant cache hit.
[2024-06-01 05:06:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:16] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 05:06:16] [INFO ] Redundant transitions in 0 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-01 05:06:16] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:16] [INFO ] Invariant cache hit.
[2024-06-01 05:06:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:17] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4441 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:23] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10095 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14806ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14986 ms. Remains : 46/46 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 46 transition count 86
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 184 place count 44 transition count 84
Applied a total of 184 rules in 9 ms. Remains 44 /46 variables (removed 2) and now considering 84/266 (removed 182) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 84 rows 44 cols
[2024-06-01 05:06:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:06:31] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 05:06:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:06:31] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 05:06:31] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 05:06:31] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 05:06:31] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 218 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 59 factoid took 4573 ms. Reduced automaton from 8 states, 42 edges and 4 AP (stutter sensitive) to 8 states, 42 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 12270 reset in 274 ms.
Product exploration explored 100000 steps with 12187 reset in 254 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:06:37] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-06-01 05:06:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:06:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:38] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:39] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5067 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 7997 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 13433ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13439ms
[2024-06-01 05:06:50] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:50] [INFO ] Invariant cache hit.
[2024-06-01 05:06:51] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 05:06:51] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:51] [INFO ] Invariant cache hit.
[2024-06-01 05:06:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:06:51] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-01 05:06:51] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-06-01 05:06:51] [INFO ] Invariant cache hit.
[2024-06-01 05:06:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:52] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:53] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4896 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-01 05:06:59] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9666 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 14902ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14905ms
Finished structural reductions in LTL mode , in 1 iterations and 28710 ms. Remains : 46/46 places, 266/266 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 finished in 161206 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(F(p0))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 264
Applied a total of 6 rules in 19 ms. Remains 43 /48 variables (removed 5) and now considering 264/266 (removed 2) transitions.
[2024-06-01 05:07:06] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
// Phase 1: matrix 84 rows 43 cols
[2024-06-01 05:07:06] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:07:06] [INFO ] Implicit Places using invariants in 74 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 42/48 places, 264/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 99 ms. Remains : 42/48 places, 264/266 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
Product exploration explored 100000 steps with 5820 reset in 204 ms.
Product exploration explored 100000 steps with 5878 reset in 218 ms.
Computed a total of 25 stabilizing places and 40 stable transitions
Computed a total of 25 stabilizing places and 40 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 264/264 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 05:07:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
// Phase 1: matrix 84 rows 42 cols
[2024-06-01 05:07:07] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:07:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:07:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 05:07:07] [INFO ] Invariant cache hit.
[2024-06-01 05:07:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:07:08] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-01 05:07:08] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 05:07:08] [INFO ] Invariant cache hit.
[2024-06-01 05:07:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:07:08] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:07:10] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 69 constraints, problems are : Problem set: 0 solved, 261 unsolved in 4879 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 261/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 330 constraints, problems are : Problem set: 0 solved, 261 unsolved in 6823 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 12000ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 12004ms
Finished structural reductions in LTL mode , in 1 iterations and 12215 ms. Remains : 42/42 places, 264/264 transitions.
Computed a total of 25 stabilizing places and 40 stable transitions
Computed a total of 25 stabilizing places and 40 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5842 reset in 215 ms.
Product exploration explored 100000 steps with 5889 reset in 203 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 05:07:21] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-01 05:07:21] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 05:07:21] [INFO ] Invariant cache hit.
[2024-06-01 05:07:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:07:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 69 constraints, problems are : Problem set: 0 solved, 261 unsolved in 4806 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 261/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 330 constraints, problems are : Problem set: 0 solved, 261 unsolved in 6015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 11121ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 11126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11141 ms. Remains : 42/42 places, 264/264 transitions.
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 264/264 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-06-01 05:07:32] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 05:07:32] [INFO ] Invariant cache hit.
[2024-06-01 05:07:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 05:07:32] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 05:07:32] [INFO ] Invariant cache hit.
[2024-06-01 05:07:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:07:32] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-01 05:07:32] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-06-01 05:07:32] [INFO ] Invariant cache hit.
[2024-06-01 05:07:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:07:33] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 05:07:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 69 constraints, problems are : Problem set: 0 solved, 261 unsolved in 4933 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 261/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 330 constraints, problems are : Problem set: 0 solved, 261 unsolved in 6875 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 12128ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 12131ms
Finished structural reductions in LTL mode , in 1 iterations and 12289 ms. Remains : 42/42 places, 264/264 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 finished in 38808 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 U (G(p0)||(p0&&G((p1 U X(p2))))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 265
Applied a total of 3 rules in 7 ms. Remains 46 /48 variables (removed 2) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:07:45] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 46 cols
[2024-06-01 05:07:45] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 05:07:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:07:46] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:07:47] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:07:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 77 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5421 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 262/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 339 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9163 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 14885ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14889ms
[2024-06-01 05:08:00] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:00] [INFO ] Invariant cache hit.
[2024-06-01 05:08:00] [INFO ] Implicit Places using invariants in 81 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 45/48 places, 265/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 14985 ms. Remains : 45/48 places, 265/266 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
Product exploration explored 100000 steps with 3401 reset in 266 ms.
Product exploration explored 100000 steps with 3418 reset in 273 ms.
Computed a total of 28 stabilizing places and 41 stable transitions
Graph (complete) has 613 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 41 stable transitions
Detected a total of 28/45 stabilizing places and 41/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 919 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 40000 steps (508 resets) in 521 ms. (76 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40002 steps (192 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (197 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (196 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
[2024-06-01 05:08:02] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-01 05:08:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:08:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 2/130 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) p2)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 34 factoid took 2421 ms. Reduced automaton from 4 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 05:08:05] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:05] [INFO ] Invariant cache hit.
[2024-06-01 05:08:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:08:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:08:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:08:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:08:05] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 05:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 05:08:05] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 14 ms.
[2024-06-01 05:08:05] [INFO ] Added : 11 causal constraints over 4 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 05:08:05] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:05] [INFO ] Invariant cache hit.
[2024-06-01 05:08:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:08:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:08:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:08:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:08:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2024-06-01 05:08:05] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 13 ms to minimize.
[2024-06-01 05:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-01 05:08:05] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 10 ms.
[2024-06-01 05:08:05] [INFO ] Added : 9 causal constraints over 2 iterations in 64 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 265/265 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:08:05] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:05] [INFO ] Invariant cache hit.
[2024-06-01 05:08:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:07] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:16] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:08:16] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/130 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 338 constraints, problems are : Problem set: 0 solved, 262 unsolved in 11563 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 4/4 constraints]
After SMT, in 16926ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 16928ms
[2024-06-01 05:08:22] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:22] [INFO ] Invariant cache hit.
[2024-06-01 05:08:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 05:08:22] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:22] [INFO ] Invariant cache hit.
[2024-06-01 05:08:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:08:22] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:22] [INFO ] Invariant cache hit.
[2024-06-01 05:08:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:24] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:08:32] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/130 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 338 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10673 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 4/4 constraints]
After SMT, in 15991ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15995ms
Finished structural reductions in LTL mode , in 1 iterations and 33118 ms. Remains : 45/45 places, 265/265 transitions.
Computed a total of 28 stabilizing places and 41 stable transitions
Graph (complete) has 613 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 41 stable transitions
Detected a total of 28/45 stabilizing places and 41/265 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 875 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 345 steps (2 resets) in 13 ms. (24 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 2205 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-06-01 05:08:42] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:42] [INFO ] Invariant cache hit.
[2024-06-01 05:08:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:08:42] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 05:08:42] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 05:08:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:08:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:08:42] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:08:42] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 05:08:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:42] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:08:43] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 05:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-01 05:08:43] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 14 ms.
[2024-06-01 05:08:43] [INFO ] Added : 11 causal constraints over 4 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 05:08:43] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:43] [INFO ] Invariant cache hit.
[2024-06-01 05:08:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:08:43] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 05:08:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:08:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:08:43] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 05:08:43] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:08:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:08:43] [INFO ] [Nat]Added 20 Read/Feed constraints in 11 ms returned sat
[2024-06-01 05:08:43] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-01 05:08:43] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 54 transitions) in 12 ms.
[2024-06-01 05:08:43] [INFO ] Added : 9 causal constraints over 2 iterations in 37 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3447 reset in 270 ms.
Product exploration explored 100000 steps with 3457 reset in 298 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 265/265 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:08:44] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:08:44] [INFO ] Invariant cache hit.
[2024-06-01 05:08:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:46] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:08:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 05:08:54] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/130 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 338 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10481 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 4/4 constraints]
After SMT, in 15845ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 15850ms
[2024-06-01 05:09:00] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:09:00] [INFO ] Invariant cache hit.
[2024-06-01 05:09:00] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 05:09:00] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:09:00] [INFO ] Invariant cache hit.
[2024-06-01 05:09:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:09:00] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 05:09:00] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-06-01 05:09:00] [INFO ] Invariant cache hit.
[2024-06-01 05:09:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:09:02] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 5362 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 05:09:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:09:10] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/130 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 338 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10326 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 4/4 constraints]
After SMT, in 16046ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 16051ms
Finished structural reductions in LTL mode , in 1 iterations and 32145 ms. Remains : 45/45 places, 265/265 transitions.
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 finished in 91634 ms.
[2024-06-01 05:09:16] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:09:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:09:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 266 transitions and 1922 arcs took 6 ms.
Total runtime 735260 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717218564668

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ltl formula name BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
ltl formula formula --ltl=/tmp/3591/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 266 transitions and 1922 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3591/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3591/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3591/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3591/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 49 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 271 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~91 levels ~10000 states ~21128 transitions
pnml2lts-mc( 2/ 4): ~94 levels ~20000 states ~51788 transitions
pnml2lts-mc( 2/ 4): ~94 levels ~40000 states ~111556 transitions
pnml2lts-mc( 1/ 4): ~94 levels ~80000 states ~233924 transitions
pnml2lts-mc( 1/ 4): ~94 levels ~160000 states ~484508 transitions
pnml2lts-mc( 1/ 4): ~94 levels ~320000 states ~995972 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 488517
pnml2lts-mc( 0/ 4): unique states count: 488517
pnml2lts-mc( 0/ 4): unique transitions count: 1568027
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 1093119
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 496687
pnml2lts-mc( 0/ 4): - cum. max stack depth: 370
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 496687 states 1603292 transitions, fanout: 3.228
pnml2lts-mc( 0/ 4): Total exploration time 3.400 sec (3.390 sec minimum, 3.395 sec on average)
pnml2lts-mc( 0/ 4): States per second: 146084, Transitions per second: 471556
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.3MB, 9.2 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 269 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.3MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
ltl formula formula --ltl=/tmp/3591/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 266 transitions and 1922 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.040 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3591/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3591/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3591/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3591/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 48 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 315 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~86!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 310
pnml2lts-mc( 0/ 4): unique states count: 464
pnml2lts-mc( 0/ 4): unique transitions count: 837
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 142
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 467
pnml2lts-mc( 0/ 4): - cum. max stack depth: 158
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 467 states 859 transitions, fanout: 1.839
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.005 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46700, Transitions per second: 85900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 28.9 B/state, compr.: 14.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 269 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
ltl formula formula --ltl=/tmp/3591/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 266 transitions and 1922 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3591/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3591/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3591/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3591/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 49 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 269 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~74 levels ~10000 states ~29240 transitions
pnml2lts-mc( 0/ 4): ~74 levels ~20000 states ~59960 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32423
pnml2lts-mc( 0/ 4): unique states count: 32423
pnml2lts-mc( 0/ 4): unique transitions count: 95894
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 66876
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 35606
pnml2lts-mc( 0/ 4): - cum. max stack depth: 286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 35606 states 106650 transitions, fanout: 2.995
pnml2lts-mc( 0/ 4): Total exploration time 0.380 sec (0.370 sec minimum, 0.377 sec on average)
pnml2lts-mc( 0/ 4): States per second: 93700, Transitions per second: 280658
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 11.7 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 269 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
ltl formula formula --ltl=/tmp/3591/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 266 transitions and 1922 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3591/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3591/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3591/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3591/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 48 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 49, there are 289 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~92 levels ~10000 states ~25484 transitions
pnml2lts-mc( 0/ 4): ~92 levels ~20000 states ~52636 transitions
pnml2lts-mc( 0/ 4): ~92 levels ~40000 states ~107620 transitions
pnml2lts-mc( 0/ 4): ~92 levels ~80000 states ~217804 transitions
pnml2lts-mc( 0/ 4): ~92 levels ~160000 states ~434904 transitions
pnml2lts-mc( 0/ 4): ~92 levels ~320000 states ~881336 transitions
pnml2lts-mc( 0/ 4): ~92 levels ~640000 states ~1843832 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 385754
pnml2lts-mc( 0/ 4): unique states count: 385754
pnml2lts-mc( 0/ 4): unique transitions count: 1140145
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 768926
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 395674
pnml2lts-mc( 0/ 4): - cum. max stack depth: 374
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 395674 states 1180142 transitions, fanout: 2.983
pnml2lts-mc( 0/ 4): Total exploration time 2.750 sec (2.740 sec minimum, 2.747 sec on average)
pnml2lts-mc( 0/ 4): States per second: 143881, Transitions per second: 429143
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.5MB, 9.6 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 269 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V10P10N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V10P10N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398600011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 ;