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.r048-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 itstools
Input is BridgeAndVehicles-COL-V10P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-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 1716320746125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 19:45:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:45:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:45:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 19:45:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:45:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 633 ms
[2024-05-21 19:45:48] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:45:48] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 19:45:48] [INFO ] Skeletonized 16 HLPN properties in 3 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.14 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.0 ms
RANDOM walk for 40000 steps (8 resets) in 1935 ms. (20 steps per ms) remains 4/25 properties
BEST_FIRST walk for 40000 steps (8 resets) in 553 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 754 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 403 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 19:45:49] [INFO ] Computed 4 invariants in 5 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 161 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 61 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 259ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 96 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=96 )
Parikh walk visited 1 properties in 6 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-05-21 19:45:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-21 19:45:50] [INFO ] Flatten gal took : 16 ms
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:45:50] [INFO ] Flatten gal took : 3 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-05-21 19:45:50] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 24 ms.
[2024-05-21 19:45:50] [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 9 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2024-05-21 19:45:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-05-21 19:45:50] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 19:45:50] [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-05-21 19:45:51] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 6 ms to minimize.
[2024-05-21 19:45:51] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 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-05-21 19:45:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 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 4708 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-05-21 19:45:58] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 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 9612 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 14851ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 14862ms
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-05-21 19:46:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-05-21 19:46:05] [INFO ] Computed 9 invariants in 6 ms
[2024-05-21 19:46:05] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 19:46:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:46:05] [INFO ] Invariant cache hit.
[2024-05-21 19:46:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:46:05] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 267 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 4 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 15158 ms. Remains : 48/48 places, 266/288 transitions.
Support contains 12 out of 48 places after structural reductions.
[2024-05-21 19:46:05] [INFO ] Flatten gal took : 34 ms
[2024-05-21 19:46:05] [INFO ] Flatten gal took : 29 ms
[2024-05-21 19:46:05] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (443 resets) in 556 ms. (71 steps per ms) remains 1/19 properties
BEST_FIRST walk for 588 steps (0 resets) in 9 ms. (58 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.5 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.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 45 ms. Remains 43 /48 variables (removed 5) and now considering 264/266 (removed 2) transitions.
[2024-05-21 19:46:05] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
// Phase 1: matrix 84 rows 43 cols
[2024-05-21 19:46:05] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:46:06] [INFO ] Implicit Places using invariants in 80 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 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 22 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 150 ms. Remains : 41/48 places, 264/266 transitions.
Stuttering acceptance computed with spot in 212 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
Product exploration explored 100000 steps with 7831 reset in 336 ms.
Product exploration explored 100000 steps with 7779 reset in 260 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 184 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 122 ms :[false, (NOT p0), (NOT p0)]
RANDOM walk for 7 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 182 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 108 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 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 13 ms. Remains 41 /41 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-21 19:46:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
// Phase 1: matrix 84 rows 41 cols
[2024-05-21 19:46:07] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:46:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 19:46:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-05-21 19:46:07] [INFO ] Invariant cache hit.
[2024-05-21 19:46:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:46:07] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 19:46:07] [INFO ] Redundant transitions in 10 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-21 19:46:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2024-05-21 19:46:07] [INFO ] Invariant cache hit.
[2024-05-21 19:46:07] [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-05-21 19:46:08] [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-05-21 19:46:10] [INFO ] Deduced a trap composed of 15 places in 43 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 5687 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 7098 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 13206ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 13211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13428 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 170 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 116 ms :[false, (NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 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 148 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 86 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[false, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7834 reset in 134 ms.
Product exploration explored 100000 steps with 7784 reset in 146 ms.
Built C files in :
/tmp/ltsmin6830684635079051906
[2024-05-21 19:46:22] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-21 19:46:22] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:46:22] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-21 19:46:22] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:46:22] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-21 19:46:22] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:46:22] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6830684635079051906
Running compilation step : cd /tmp/ltsmin6830684635079051906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 830 ms.
Running link step : cd /tmp/ltsmin6830684635079051906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin6830684635079051906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12643308372587508406.hoa' '--buchi-type=spotba'
LTSmin run took 9830 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02 finished in 27091 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 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-05-21 19:46:33] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-05-21 19:46:33] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:46:33] [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-05-21 19:46:33] [INFO ] Deduced a trap composed of 5 places in 63 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-05-21 19:46:35] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 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-05-21 19:46:36] [INFO ] Deduced a trap composed of 14 places in 37 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 6219 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 6485 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 13036ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13040ms
[2024-05-21 19:46:46] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:46:46] [INFO ] Invariant cache hit.
[2024-05-21 19:46:46] [INFO ] Implicit Places using invariants in 86 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 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 13136 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 254 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 158 steps with 7 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05 finished in 13427 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 23 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:46:46] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:46:46] [INFO ] Invariant cache hit.
[2024-05-21 19:46:46] [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-05-21 19:46:47] [INFO ] Deduced a trap composed of 5 places in 43 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-05-21 19:46:48] [INFO ] Deduced a trap composed of 6 places in 58 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-05-21 19:46:50] [INFO ] Deduced a trap composed of 14 places in 41 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 6088 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 8106 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 14526ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14532ms
[2024-05-21 19:47:00] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:00] [INFO ] Invariant cache hit.
[2024-05-21 19:47:01] [INFO ] Implicit Places using invariants in 107 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 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 10 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 14675 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 117 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 14807 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 2 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:47:01] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-05-21 19:47:01] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 19:47:01] [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-05-21 19:47:02] [INFO ] Deduced a trap composed of 5 places in 75 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-05-21 19:47:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:47:03] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 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 4768 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 7152 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 12241ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 12245ms
[2024-05-21 19:47:13] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:13] [INFO ] Invariant cache hit.
[2024-05-21 19:47:13] [INFO ] Implicit Places using invariants in 121 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 123 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 12373 ms. Remains : 44/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08
Stuttering criterion allowed to conclude after 559 steps with 17 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08 finished in 12506 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 4 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:47:13] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-05-21 19:47:13] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 19:47:13] [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-05-21 19:47:14] [INFO ] Deduced a trap composed of 5 places in 55 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-05-21 19:47:16] [INFO ] Deduced a trap composed of 6 places in 70 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 5659 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-05-21 19:47:22] [INFO ] Deduced a trap composed of 14 places in 88 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 9906 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 15909ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15913ms
[2024-05-21 19:47:29] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:29] [INFO ] Invariant cache hit.
[2024-05-21 19:47:29] [INFO ] Implicit Places using invariants in 111 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 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 16034 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 396 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 12176 reset in 345 ms.
Product exploration explored 100000 steps with 12240 reset in 315 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 1752 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 361 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 708 ms. (56 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40003 steps (136 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (141 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (116 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (132 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40006 steps (135 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
[2024-05-21 19:47:33] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-05-21 19:47:33] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:47:33] [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 230 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-05-21 19:47:35] [INFO ] Deduced a trap composed of 5 places in 58 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 1575 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 1859ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 235 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 8 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:47:35] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:35] [INFO ] Invariant cache hit.
[2024-05-21 19:47:35] [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-05-21 19:47:36] [INFO ] Deduced a trap composed of 5 places in 45 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-05-21 19:47:37] [INFO ] Deduced a trap composed of 6 places in 48 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 4302 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-05-21 19:47:43] [INFO ] Deduced a trap composed of 15 places in 57 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 10171 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 14827ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14840 ms. Remains : 46/46 places, 266/266 transitions.
RANDOM walk for 40000 steps (440 resets) in 686 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (135 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (137 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (116 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (124 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (132 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 543294 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 6
Probabilistic random walk after 543294 steps, saw 133321 distinct states, run finished after 3004 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-21 19:47:54] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:54] [INFO ] Invariant cache hit.
[2024-05-21 19:47:54] [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 151 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-05-21 19:47:54] [INFO ] Deduced a trap composed of 5 places in 65 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 433 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 608ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 267 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 20 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-21 19:47:55] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:55] [INFO ] Invariant cache hit.
[2024-05-21 19:47:55] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 19:47:55] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:55] [INFO ] Invariant cache hit.
[2024-05-21 19:47:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:47:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-21 19:47:55] [INFO ] Redundant transitions in 3 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 19:47:55] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:47:55] [INFO ] Invariant cache hit.
[2024-05-21 19:47:55] [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-05-21 19:47:56] [INFO ] Deduced a trap composed of 5 places in 61 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-05-21 19:47:57] [INFO ] Deduced a trap composed of 6 places in 62 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 5018 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-05-21 19:48:03] [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 10077 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 15445ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15741 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-05-21 19:48:10] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:48:10] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 19:48:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 19:48:10] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 19:48:10] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 19:48:11] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 19:48:11] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 629 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 4566 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 392 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 386 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-05-21 19:48:16] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-05-21 19:48:16] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 19:48: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-05-21 19:48:17] [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-05-21 19:48:18] [INFO ] Deduced a trap composed of 6 places in 43 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 4319 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 8294 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 12971ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 12976ms
[2024-05-21 19:48:29] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:48:29] [INFO ] Invariant cache hit.
[2024-05-21 19:48:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 19:48:29] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:48:29] [INFO ] Invariant cache hit.
[2024-05-21 19:48:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:48:30] [INFO ] Implicit Places using invariants and state equation in 139 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-05-21 19:48:30] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:48:30] [INFO ] Invariant cache hit.
[2024-05-21 19:48:30] [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-05-21 19:48:30] [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-05-21 19:48:31] [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 4311 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-05-21 19:48:37] [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 9388 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 13936ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13939ms
Finished structural reductions in LTL mode , in 1 iterations and 27137 ms. Remains : 46/46 places, 266/266 transitions.
Computed a total of 29 stabilizing places and 42 stable transitions
Graph (complete) has 615 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 42 stable transitions
Detected a total of 29/46 stabilizing places and 42/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 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 1040 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 249 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 (441 resets) in 178 ms. (223 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40004 steps (136 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (140 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (117 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (124 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (131 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (136 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
[2024-05-21 19:48:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:48:45] [INFO ] Invariant cache hit.
[2024-05-21 19:48:45] [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 118 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-05-21 19:48:46] [INFO ] Deduced a trap composed of 5 places in 70 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 578 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 716ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 159 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.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:48:46] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:48:46] [INFO ] Invariant cache hit.
[2024-05-21 19:48: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-05-21 19:48:47] [INFO ] Deduced a trap composed of 5 places in 70 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-05-21 19:48:48] [INFO ] Deduced a trap composed of 6 places in 63 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 4864 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-05-21 19:48:54] [INFO ] Deduced a trap composed of 15 places in 68 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 9743 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 14831ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14842 ms. Remains : 46/46 places, 266/266 transitions.
RANDOM walk for 40000 steps (443 resets) in 352 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (140 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (124 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (131 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (136 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 624871 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 6
Probabilistic random walk after 624871 steps, saw 152295 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2024-05-21 19:49:04] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:49:04] [INFO ] Invariant cache hit.
[2024-05-21 19:49:04] [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 129 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-05-21 19:49:04] [INFO ] Deduced a trap composed of 5 places in 77 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 496 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 657ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 361 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 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-05-21 19:49:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:49:05] [INFO ] Invariant cache hit.
[2024-05-21 19:49:05] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 19:49:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:49:05] [INFO ] Invariant cache hit.
[2024-05-21 19:49:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:49:05] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-21 19:49:05] [INFO ] Redundant transitions in 3 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 19:49:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:49:05] [INFO ] Invariant cache hit.
[2024-05-21 19:49:05] [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-05-21 19:49:06] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 5 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-05-21 19:49:07] [INFO ] Deduced a trap composed of 6 places in 45 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 4141 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-05-21 19:49:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 15 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 9847 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 14228ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 14230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14563 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 28 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-05-21 19:49:20] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:49:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 19:49:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 19:49:20] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:49:20] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 19:49:20] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 19:49:20] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 244 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 4574 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 316 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 301 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 288 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 12217 reset in 232 ms.
Product exploration explored 100000 steps with 12267 reset in 322 ms.
Built C files in :
/tmp/ltsmin7193044525016633558
[2024-05-21 19:49:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7193044525016633558
Running compilation step : cd /tmp/ltsmin7193044525016633558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 614 ms.
Running link step : cd /tmp/ltsmin7193044525016633558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7193044525016633558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1659133492051026106.hoa' '--buchi-type=spotba'
LTSmin run took 153 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10 finished in 133780 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-05-21 19:49:27] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-05-21 19:49:27] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:49:27] [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-05-21 19:49:28] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 19:49:29] [INFO ] Deduced a trap composed of 6 places in 66 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 5220 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-05-21 19:49:36] [INFO ] Deduced a trap composed of 14 places in 70 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 10584 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 16142ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 16146ms
[2024-05-21 19:49:43] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:49:43] [INFO ] Invariant cache hit.
[2024-05-21 19:49:43] [INFO ] Implicit Places using invariants in 133 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 135 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16285 ms. Remains : 45/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 234 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 16536 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 5 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 19:49:44] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-05-21 19:49:44] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:49:44] [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-05-21 19:49:45] [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) 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 3935 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-05-21 19:49:51] [INFO ] Deduced a trap composed of 14 places in 64 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 8553 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 12974ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 12980ms
[2024-05-21 19:49:57] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 19:49:57] [INFO ] Invariant cache hit.
[2024-05-21 19:49:57] [INFO ] Implicit Places using invariants in 59 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 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 1 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 13060 ms. Remains : 44/48 places, 265/266 transitions.
Stuttering acceptance computed with spot in 89 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 4796 reset in 193 ms.
Product exploration explored 100000 steps with 4839 reset in 197 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 157 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 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 16 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 140 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 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 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 3 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 19:49:58] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 44 cols
[2024-05-21 19:49:58] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:49:58] [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-05-21 19:49:58] [INFO ] Deduced a trap composed of 5 places in 50 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-05-21 19:50:00] [INFO ] Deduced a trap composed of 15 places in 58 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 4724 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 6102 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 11097ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11100ms
[2024-05-21 19:50:09] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 19:50:09] [INFO ] Invariant cache hit.
[2024-05-21 19:50:09] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 19:50:09] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 19:50:09] [INFO ] Invariant cache hit.
[2024-05-21 19:50:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:50:09] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-21 19:50:09] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 19:50:09] [INFO ] Invariant cache hit.
[2024-05-21 19:50:09] [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-05-21 19:50:10] [INFO ] Deduced a trap composed of 5 places in 42 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 4000 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 6768 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 11085ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11089ms
Finished structural reductions in LTL mode , in 1 iterations and 22436 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 156 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)]
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 142 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 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4931 reset in 264 ms.
Product exploration explored 100000 steps with 4927 reset in 238 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 133 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 23 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 19:50:22] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 44 cols
[2024-05-21 19:50:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:50:22] [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-05-21 19:50:23] [INFO ] Deduced a trap composed of 5 places in 43 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
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-05-21 19:50:24] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 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 4232 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-05-21 19:50:29] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 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 7202 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 11874ms problems are : Problem set: 1 solved, 261 unsolved
Search for dead transitions found 1 dead transitions in 11880ms
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-05-21 19:50:34] [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 22 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 11937 ms. Remains : 42/44 places, 264/265 transitions.
Built C files in :
/tmp/ltsmin3494629108609440329
[2024-05-21 19:50:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3494629108609440329
Running compilation step : cd /tmp/ltsmin3494629108609440329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 510 ms.
Running link step : cd /tmp/ltsmin3494629108609440329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3494629108609440329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5405237760723101098.hoa' '--buchi-type=spotba'
LTSmin run took 13001 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 finished in 63832 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-05-21 19:50:47] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-05-21 19:50:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 19:50:47] [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-05-21 19:50:48] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 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-05-21 19:50:50] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:50:50] [INFO ] Deduced a trap composed of 7 places in 40 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 5172 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-05-21 19:50:56] [INFO ] Deduced a trap composed of 6 places in 80 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 11172 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 16671ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 16675ms
[2024-05-21 19:51:04] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:04] [INFO ] Invariant cache hit.
[2024-05-21 19:51:04] [INFO ] Implicit Places using invariants in 115 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 120 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 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 16800 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 260 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 17081 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 5 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:51:04] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-05-21 19:51:04] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:51:04] [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-05-21 19:51:05] [INFO ] Deduced a trap composed of 5 places in 64 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-05-21 19:51:07] [INFO ] Deduced a trap composed of 6 places in 64 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 5328 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-05-21 19:51:13] [INFO ] Deduced a trap composed of 14 places in 71 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 9981 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 15627ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15633ms
[2024-05-21 19:51:20] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:20] [INFO ] Invariant cache hit.
[2024-05-21 19:51:20] [INFO ] Implicit Places using invariants in 122 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 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 15769 ms. Remains : 46/48 places, 266/266 transitions.
Stuttering acceptance computed with spot in 269 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 3191 reset in 307 ms.
Product exploration explored 100000 steps with 3139 reset in 291 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 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 934 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 226 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 279 ms. (142 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (155 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (158 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (157 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
[2024-05-21 19:51:23] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-05-21 19:51:23] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:51:23] [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 15 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 28ms 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 2914 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 260 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-21 19:51:26] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:26] [INFO ] Invariant cache hit.
[2024-05-21 19:51:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:51:26] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:51:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 19:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:51:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:51:26] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 19:51:26] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 19:51:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:51:26] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-21 19:51:26] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 16 ms.
[2024-05-21 19:51:26] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 19:51:26] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:26] [INFO ] Invariant cache hit.
[2024-05-21 19:51:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:51:27] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 19:51:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 19:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:51:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 19:51:27] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:51:27] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 19:51:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:51:27] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-21 19:51:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2024-05-21 19:51:27] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 31 ms.
[2024-05-21 19:51:27] [INFO ] Added : 14 causal constraints over 4 iterations in 124 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 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-05-21 19:51:27] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:27] [INFO ] Invariant cache hit.
[2024-05-21 19:51:27] [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-05-21 19:51:28] [INFO ] Deduced a trap composed of 5 places in 70 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-05-21 19:51:30] [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 4908 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-05-21 19:51:35] [INFO ] Deduced a trap composed of 15 places in 81 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 10197 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 15456ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15461ms
[2024-05-21 19:51:43] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:43] [INFO ] Invariant cache hit.
[2024-05-21 19:51:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 19:51:43] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:43] [INFO ] Invariant cache hit.
[2024-05-21 19:51:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:51:43] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-21 19:51:43] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:51:43] [INFO ] Invariant cache hit.
[2024-05-21 19:51:43] [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-05-21 19:51:44] [INFO ] Deduced a trap composed of 5 places in 52 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-05-21 19:51:45] [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 4642 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-05-21 19:51:50] [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 10435 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 15317ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 15320ms
Finished structural reductions in LTL mode , in 1 iterations and 31026 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 677 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 275 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 492 steps (4 resets) in 13 ms. (35 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 2340 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 248 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-21 19:52:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:52:02] [INFO ] Invariant cache hit.
[2024-05-21 19:52:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 19:52:02] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:52:02] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 19:52:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:52:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:52:02] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:52:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 19:52:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:52:02] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-21 19:52:02] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 16 ms.
[2024-05-21 19:52:02] [INFO ] Added : 11 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 19:52:02] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 19:52:02] [INFO ] Invariant cache hit.
[2024-05-21 19:52:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:52:03] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:52:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 19:52:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:52:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 19:52:03] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:52:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 19:52:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:52:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 15 ms returned sat
[2024-05-21 19:52:03] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:52:03] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-21 19:52:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2024-05-21 19:52:03] [INFO ] Computed and/alt/rep : 28/56/28 causal constraints (skipped 55 transitions) in 26 ms.
[2024-05-21 19:52:03] [INFO ] Added : 14 causal constraints over 4 iterations in 123 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3144 reset in 268 ms.
Product exploration explored 100000 steps with 3219 reset in 253 ms.
Built C files in :
/tmp/ltsmin17223588768056195500
[2024-05-21 19:52:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17223588768056195500
Running compilation step : cd /tmp/ltsmin17223588768056195500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 748 ms.
Running link step : cd /tmp/ltsmin17223588768056195500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin17223588768056195500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7114216585057218216.hoa' '--buchi-type=spotba'
LTSmin run took 4153 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 finished in 64598 ms.
All properties solved by simple procedures.
Total runtime 382090 ms.

BK_STOP 1716321129614

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V10P10N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V10P10N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-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 ;