Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K Apr 13 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 02:09 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 4.2K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 02:28 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 40K 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-V20P10N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717217841713

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 04:57:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 654 ms
[2024-06-01 04:57:23] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 04:57:24] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2024-06-01 04:57:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12 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.4 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 1869 ms. (21 steps per ms) remains 5/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 117 ms. (338 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 4/5 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:25] [INFO ] Computed 4 invariants in 5 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 4 solved, 0 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:25] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 04:57:25] [INFO ] Flatten gal took : 15 ms
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:25] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:25] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 58 ms.
[2024-06-01 04:57:25] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 13 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 24 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-06-01 04:57:25] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-06-01 04:57:25] [INFO ] Computed 7 invariants in 11 ms
[2024-06-01 04:57:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-06-01 04:57:32] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 26 ms to minimize.
[2024-06-01 04:57:34] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-06-01 04:57:36] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
[2024-06-01 04:57:43] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/11 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 78/248 variables, and 11 constraints, problems are : Problem set: 40 solved, 925 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/78 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 40 solved, 925 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/11 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 6 (OVERLAPS) 170/248 variables, 78/89 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 42/131 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 923/1054 constraints. Problems are: Problem set: 42 solved, 923 unsolved
[2024-06-01 04:58:08] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 248/248 variables, and 1055 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 923/965 constraints, Known Traps: 5/5 constraints]
After SMT, in 43922ms problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43960ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-06-01 04:58:09] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 78 cols
[2024-06-01 04:58:09] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 04:58:09] [INFO ] Implicit Places using invariants in 192 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/78 places, 926/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 77 /77 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44229 ms. Remains : 77/78 places, 926/968 transitions.
Support contains 13 out of 77 places after structural reductions.
[2024-06-01 04:58:09] [INFO ] Flatten gal took : 114 ms
[2024-06-01 04:58:09] [INFO ] Flatten gal took : 89 ms
[2024-06-01 04:58:10] [INFO ] Input system was already deterministic with 926 transitions.
RANDOM walk for 40000 steps (228 resets) in 3369 ms. (11 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (88 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (82 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 175 ms. (227 steps per ms) remains 2/3 properties
[2024-06-01 04:58:11] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-06-01 04:58:11] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 04:58:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 6/243 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/77 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1596 edges and 77 vertex of which 75 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 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)&&X(F(p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Applied a total of 1 rules in 18 ms. Remains 76 /77 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 04:58:11] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 04:58:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 04:58:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 04:58:17] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 04:58:26] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
SMT process timed out in 23323ms, After SMT, problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 23335ms
[2024-06-01 04:58:34] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:34] [INFO ] Invariant cache hit.
[2024-06-01 04:58:35] [INFO ] Implicit Places using invariants in 157 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/77 places, 926/926 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23523 ms. Remains : 75/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 525 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Computed a total of 48 stabilizing places and 82 stable transitions
Graph (complete) has 1552 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 48 stabilizing places and 82 stable transitions
Detected a total of 48/75 stabilizing places and 82/926 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 31 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-02 finished in 24848 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(p1)))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Graph (complete) has 1596 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 925
Applied a total of 3 rules in 116 ms. Remains 75 /77 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 04:58:36] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-06-01 04:58:36] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 04:58:36] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:58:41] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 23164ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 23177ms
[2024-06-01 04:58:59] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 04:58:59] [INFO ] Invariant cache hit.
[2024-06-01 04:58:59] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 04:58:59] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 04:58:59] [INFO ] Invariant cache hit.
[2024-06-01 04:58:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 04:59:00] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-06-01 04:59:00] [INFO ] Redundant transitions in 85 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 04:59:00] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 04:59:00] [INFO ] Invariant cache hit.
[2024-06-01 04:59:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:59:05] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:59:16] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 62696ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 62713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/77 places, 925/926 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86728 ms. Remains : 75/77 places, 925/926 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03
Product exploration explored 100000 steps with 776 reset in 549 ms.
Product exploration explored 100000 steps with 792 reset in 395 ms.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1593 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/75 stabilizing places and 81/925 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 564 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 466 steps (3 resets) in 10 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 737 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 925/925 transitions.
Applied a total of 0 rules in 59 ms. Remains 75 /75 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:00:05] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:00:05] [INFO ] Invariant cache hit.
[2024-06-01 05:00:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:00:21] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/240 variables, and 9 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/75 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42897ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42912ms
[2024-06-01 05:00:48] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:00:48] [INFO ] Invariant cache hit.
[2024-06-01 05:00:48] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 05:00:48] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:00:48] [INFO ] Invariant cache hit.
[2024-06-01 05:00:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:00:49] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-06-01 05:00:49] [INFO ] Redundant transitions in 13 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 05:00:49] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:00:49] [INFO ] Invariant cache hit.
[2024-06-01 05:00:49] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:00:53] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:01:04] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 62624ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 62638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106243 ms. Remains : 75/75 places, 925/925 transitions.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1593 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/75 stabilizing places and 81/925 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 679 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 187 steps (1 resets) in 9 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 847 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 774 reset in 477 ms.
Product exploration explored 100000 steps with 780 reset in 549 ms.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 925/925 transitions.
Applied a total of 0 rules in 76 ms. Remains 75 /75 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:01:55] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:01:55] [INFO ] Invariant cache hit.
[2024-06-01 05:01:55] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:01:59] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:02:09] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 23060ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 23074ms
[2024-06-01 05:02:18] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:02:18] [INFO ] Invariant cache hit.
[2024-06-01 05:02:18] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 05:02:18] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:02:18] [INFO ] Invariant cache hit.
[2024-06-01 05:02:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:02:18] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-06-01 05:02:18] [INFO ] Redundant transitions in 6 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 05:02:18] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:02:18] [INFO ] Invariant cache hit.
[2024-06-01 05:02:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:02:22] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:02:33] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 62765ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 62775ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86332 ms. Remains : 75/75 places, 925/925 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03 finished in 285027 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(G(p0))||F((p0&&G(p1)))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Applied a total of 1 rules in 11 ms. Remains 76 /77 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:03:21] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 05:03:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 05:03:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:03:27] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:03:36] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 20.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/242 variables, and 9 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/76 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 923/1048 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:04:03] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-01 05:04:03] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1050 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 4/4 constraints]
After SMT, in 43336ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43348ms
[2024-06-01 05:04:04] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:04:04] [INFO ] Invariant cache hit.
[2024-06-01 05:04:04] [INFO ] Implicit Places using invariants in 128 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/77 places, 926/926 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43520 ms. Remains : 75/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04
Stuttering criterion allowed to conclude after 669 steps with 3 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-04 finished in 43692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Graph (complete) has 1596 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 925
Applied a total of 3 rules in 50 ms. Remains 75 /77 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:04:05] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-06-01 05:04:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:04:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:04:09] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:04:19] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 23084ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 23093ms
[2024-06-01 05:04:28] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:04:28] [INFO ] Invariant cache hit.
[2024-06-01 05:04:28] [INFO ] Implicit Places using invariants in 140 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/77 places, 925/926 transitions.
Applied a total of 0 rules in 36 ms. Remains 74 /74 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23336 ms. Remains : 74/77 places, 925/926 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-07
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-07 finished in 23384 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(p1)))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Graph (complete) has 1596 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 925
Applied a total of 3 rules in 47 ms. Remains 75 /77 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:04:28] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:04:28] [INFO ] Invariant cache hit.
[2024-06-01 05:04:28] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:04:33] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:04:43] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 23004ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 23013ms
[2024-06-01 05:04:51] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:04:51] [INFO ] Invariant cache hit.
[2024-06-01 05:04:51] [INFO ] Implicit Places using invariants in 130 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/77 places, 925/926 transitions.
Applied a total of 0 rules in 37 ms. Remains 74 /74 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23246 ms. Remains : 74/77 places, 925/926 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08
Product exploration explored 100000 steps with 1688 reset in 277 ms.
Product exploration explored 100000 steps with 1693 reset in 289 ms.
Computed a total of 47 stabilizing places and 81 stable transitions
Graph (complete) has 1550 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 47 stabilizing places and 81 stable transitions
Detected a total of 47/74 stabilizing places and 81/925 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 289 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:04:53] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 74 cols
[2024-06-01 05:04:53] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:04:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:53] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 05:04:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:53] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 05:04:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:04:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 56 ms returned sat
[2024-06-01 05:04:53] [INFO ] Computed and/alt/rep : 58/116/58 causal constraints (skipped 104 transitions) in 50 ms.
[2024-06-01 05:04:53] [INFO ] Added : 34 causal constraints over 7 iterations in 202 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 925/925 transitions.
Applied a total of 0 rules in 62 ms. Remains 74 /74 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:04:54] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:04:54] [INFO ] Invariant cache hit.
[2024-06-01 05:04:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:04:59] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:05:08] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/239 variables, and 8 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/74 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (OVERLAPS) 165/239 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 922/1044 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 1044 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 43474ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43486ms
[2024-06-01 05:05:37] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:05:37] [INFO ] Invariant cache hit.
[2024-06-01 05:05:37] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 05:05:37] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:05:37] [INFO ] Invariant cache hit.
[2024-06-01 05:05:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:05:38] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-06-01 05:05:38] [INFO ] Redundant transitions in 14 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 05:05:38] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:05:38] [INFO ] Invariant cache hit.
[2024-06-01 05:05:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:05:42] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:05:52] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (OVERLAPS) 165/239 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:06:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:06:08] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/239 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (OVERLAPS) 165/239 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 4/4 constraints]
After SMT, in 62375ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 62389ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106629 ms. Remains : 74/74 places, 925/925 transitions.
Computed a total of 47 stabilizing places and 81 stable transitions
Graph (complete) has 1550 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 47 stabilizing places and 81 stable transitions
Detected a total of 47/74 stabilizing places and 81/925 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 236 steps (0 resets) in 8 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:06:41] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:06:41] [INFO ] Invariant cache hit.
[2024-06-01 05:06:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:06:41] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 05:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:06:41] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 05:06:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:06:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 69 ms returned sat
[2024-06-01 05:06:41] [INFO ] Computed and/alt/rep : 58/116/58 causal constraints (skipped 104 transitions) in 63 ms.
[2024-06-01 05:06:42] [INFO ] Added : 25 causal constraints over 7 iterations in 193 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1701 reset in 414 ms.
Product exploration explored 100000 steps with 1694 reset in 426 ms.
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 925/925 transitions.
Applied a total of 0 rules in 42 ms. Remains 74 /74 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:06:43] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:06:43] [INFO ] Invariant cache hit.
[2024-06-01 05:06:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:06:47] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:06:56] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (OVERLAPS) 165/239 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 22825ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 22836ms
[2024-06-01 05:07:05] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:07:05] [INFO ] Invariant cache hit.
[2024-06-01 05:07:06] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 05:07:06] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:07:06] [INFO ] Invariant cache hit.
[2024-06-01 05:07:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:07:06] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-01 05:07:06] [INFO ] Redundant transitions in 7 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 05:07:06] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:07:06] [INFO ] Invariant cache hit.
[2024-06-01 05:07:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:07:10] [INFO ] Deduced a trap composed of 5 places in 392 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:07:20] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (OVERLAPS) 165/239 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:07:37] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/239 variables, and 123 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (OVERLAPS) 165/239 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 922/1045 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 1045 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 3/3 constraints]
After SMT, in 62310ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 62319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85752 ms. Remains : 74/74 places, 925/925 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08 finished in 220446 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(G((X(G(p0)) U (p1 U X(p2))))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Applied a total of 1 rules in 4 ms. Remains 76 /77 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:08:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 05:08:08] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 05:08:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:08:13] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:08:23] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
SMT process timed out in 22800ms, After SMT, problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 22810ms
[2024-06-01 05:08:31] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:08:31] [INFO ] Invariant cache hit.
[2024-06-01 05:08:31] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 05:08:31] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:08:31] [INFO ] Invariant cache hit.
[2024-06-01 05:08:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:08:32] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:08:32] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:08:32] [INFO ] Invariant cache hit.
[2024-06-01 05:08:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:08:36] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:08:46] [INFO ] Deduced a trap composed of 6 places in 557 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 79.0 8.0))
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 (/ 7.0 8.0))
(s23 (/ 1.0 8.0))
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 15.0)
(s47 (/ 7.0 8.0))
(s48 (/ 33.0 8.0))
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 timeout
0.0)
(s67 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/242 variables, and 125 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 923/1048 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 62861ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 62870ms
Starting structural reductions in LTL mode, iteration 1 : 76/77 places, 926/926 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86102 ms. Remains : 76/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 509 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13
Product exploration explored 100000 steps with 28549 reset in 436 ms.
Product exploration explored 100000 steps with 28586 reset in 374 ms.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1595 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/76 stabilizing places and 82/926 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 500 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (228 resets) in 344 ms. (115 steps per ms) remains 1/8 properties
BEST_FIRST walk for 304 steps (0 resets) in 6 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 842 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:09:38] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:09:38] [INFO ] Invariant cache hit.
[2024-06-01 05:09:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:09:46] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:09:55] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/242 variables, and 9 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/76 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 923/1048 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 45014ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 45028ms
[2024-06-01 05:10:23] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:10:23] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 05:10:24] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:10:24] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:10:24] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:10:31] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:10:41] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/242 variables, and 125 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 923/1048 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 63650ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 63662ms
Finished structural reductions in LTL mode , in 1 iterations and 109260 ms. Remains : 76/76 places, 926/926 transitions.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1595 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/76 stabilizing places and 82/926 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (228 resets) in 309 ms. (129 steps per ms) remains 1/8 properties
BEST_FIRST walk for 304 steps (0 resets) in 6 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 1107 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 458 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 28630 reset in 491 ms.
Product exploration explored 100000 steps with 28538 reset in 436 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true, false]
Stuttering acceptance computed with spot in 456 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 926/926 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 73 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:11:33] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 05:11:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:11:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:11:38] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:11:48] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/242 variables, and 9 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/76 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 1 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 1 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 922/1047 constraints. Problems are: Problem set: 1 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1047 constraints, problems are : Problem set: 1 solved, 922 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 43285ms problems are : Problem set: 1 solved, 922 unsolved
Search for dead transitions found 1 dead transitions in 43296ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-06-01 05:12:16] [INFO ] Redundant transitions in 16 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 925/926 transitions.
Graph (complete) has 1593 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 81 ms. Remains 75 /76 variables (removed 1) and now considering 925/925 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/76 places, 925/926 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43480 ms. Remains : 75/76 places, 925/926 transitions.
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:12:16] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 05:12:16] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:12:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:12:22] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:12:32] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/242 variables, and 9 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/76 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 923/1048 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:12:59] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2024-06-01 05:12:59] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1050 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 4/4 constraints]
After SMT, in 43542ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43556ms
[2024-06-01 05:13:00] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:13:00] [INFO ] Invariant cache hit.
[2024-06-01 05:13:00] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 05:13:00] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:13:00] [INFO ] Invariant cache hit.
[2024-06-01 05:13:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:13:00] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:13:00] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:13:00] [INFO ] Invariant cache hit.
[2024-06-01 05:13:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:13:05] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:13:15] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/242 variables, and 125 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/242 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 923/1048 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 62982ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 62993ms
Finished structural reductions in LTL mode , in 1 iterations and 107081 ms. Remains : 76/76 places, 926/926 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 finished in 355129 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)||X((X(G(!p0))&&F(p1)))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 926
Applied a total of 2 rules in 10 ms. Remains 75 /77 variables (removed 2) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:14:04] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 75 cols
[2024-06-01 05:14:04] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:14:04] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:14:09] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/241 variables, 75/82 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:14:22] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/241 variables, and 123 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/241 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 923/1046 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 1046 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 43609ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43627ms
[2024-06-01 05:14:47] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 05:14:47] [INFO ] Invariant cache hit.
[2024-06-01 05:14:47] [INFO ] Implicit Places using invariants in 191 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/77 places, 926/926 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43840 ms. Remains : 74/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), false, p0, true, (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15 finished in 44275 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(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0)) U (p1 U X(p2))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13
Stuttering acceptance computed with spot in 500 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Graph (complete) has 1596 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 925
Applied a total of 3 rules in 29 ms. Remains 75 /77 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:14:49] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-06-01 05:14:49] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:14:49] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:14:54] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:15:03] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/240 variables, and 9 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/75 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42984ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42999ms
[2024-06-01 05:15:32] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:15:32] [INFO ] Invariant cache hit.
[2024-06-01 05:15:32] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 05:15:32] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:15:32] [INFO ] Invariant cache hit.
[2024-06-01 05:15:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:15:32] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:15:32] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:15:32] [INFO ] Invariant cache hit.
[2024-06-01 05:15:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:15:38] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:15:46] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 63116ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 63130ms
Starting structural reductions in LI_LTL mode, iteration 1 : 75/77 places, 925/926 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 106733 ms. Remains : 75/77 places, 925/926 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13
Product exploration explored 100000 steps with 28518 reset in 354 ms.
Product exploration explored 100000 steps with 28520 reset in 346 ms.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1593 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/75 stabilizing places and 81/925 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 529 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (264 resets) in 328 ms. (121 steps per ms) remains 1/8 properties
BEST_FIRST walk for 304 steps (0 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 791 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 925/925 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:16:39] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:16:39] [INFO ] Invariant cache hit.
[2024-06-01 05:16:39] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:16:44] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:16:54] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 23256ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 23270ms
[2024-06-01 05:17:02] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:17:02] [INFO ] Invariant cache hit.
[2024-06-01 05:17:02] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 05:17:02] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:17:02] [INFO ] Invariant cache hit.
[2024-06-01 05:17:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:17:03] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:17:03] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:17:03] [INFO ] Invariant cache hit.
[2024-06-01 05:17:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:17:08] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:17:18] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 (/ 3.0 4.0))
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 3.0 4.0))
(s47 (/ 77.0 4.0))
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 63550ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 63559ms
Finished structural reductions in LTL mode , in 1 iterations and 87341 ms. Remains : 75/75 places, 925/925 transitions.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1593 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/75 stabilizing places and 81/925 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 564 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (264 resets) in 315 ms. (126 steps per ms) remains 1/8 properties
BEST_FIRST walk for 304 steps (0 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 969 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 28558 reset in 437 ms.
Product exploration explored 100000 steps with 28587 reset in 496 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true, false]
Stuttering acceptance computed with spot in 404 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (NOT p0), (AND (NOT p2) p0), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 925/925 transitions.
Applied a total of 0 rules in 59 ms. Remains 75 /75 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:18:11] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:18:11] [INFO ] Invariant cache hit.
[2024-06-01 05:18:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:18:17] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:18:27] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/240 variables, and 9 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/75 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 43867ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43880ms
[2024-06-01 05:18:55] [INFO ] Redundant transitions in 10 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 05:18:55] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:18:55] [INFO ] Invariant cache hit.
[2024-06-01 05:18:55] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:19:00] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:19:10] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 63641ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 63655ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107618 ms. Remains : 75/75 places, 925/925 transitions.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 925/925 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:19:59] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:19:59] [INFO ] Invariant cache hit.
[2024-06-01 05:19:59] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:20:03] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:20:12] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
SMT process timed out in 22245ms, After SMT, problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 22254ms
[2024-06-01 05:20:21] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:20:21] [INFO ] Invariant cache hit.
[2024-06-01 05:20:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 05:20:21] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:20:21] [INFO ] Invariant cache hit.
[2024-06-01 05:20:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:20:21] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:20:21] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 05:20:21] [INFO ] Invariant cache hit.
[2024-06-01 05:20:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:20:27] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:20:38] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 63428ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 63439ms
Finished structural reductions in LTL mode , in 1 iterations and 86218 ms. Remains : 75/75 places, 925/925 transitions.
Treatment of property BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 finished in 396776 ms.
[2024-06-01 05:21:25] [INFO ] Flatten gal took : 46 ms
[2024-06-01 05:21:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 05:21:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 926 transitions and 6982 arcs took 13 ms.
Total runtime 1442363 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717219499855

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BridgeAndVehicles-COL-V20P10N20-LTLCardinality-03
ltl formula formula --ltl=/tmp/2331/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 77 places, 926 transitions and 6982 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2331/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2331/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2331/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2331/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 78, there are 932 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~162 levels ~10000 states ~26472 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~20000 states ~52348 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~40000 states ~116980 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~80000 states ~245636 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~160000 states ~507140 transitions
pnml2lts-mc( 2/ 4): ~162 levels ~320000 states ~1044764 transitions
pnml2lts-mc( 1/ 4): ~118 levels ~640000 states ~2207244 transitions
pnml2lts-mc( 1/ 4): ~174 levels ~1280000 states ~4402864 transitions
pnml2lts-mc( 1/ 4): ~174 levels ~2560000 states ~9598704 transitions
pnml2lts-mc( 1/ 4): ~174 levels ~5120000 states ~21749920 transitions
pnml2lts-mc( 1/ 4): ~174 levels ~10240000 states ~46732424 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16095980
pnml2lts-mc( 0/ 4): unique states count: 16095980
pnml2lts-mc( 0/ 4): unique transitions count: 77629350
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 61599765
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16132650
pnml2lts-mc( 0/ 4): - cum. max stack depth: 686
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16132650 states 77805527 transitions, fanout: 4.823
pnml2lts-mc( 0/ 4): Total exploration time 112.730 sec (112.720 sec minimum, 112.725 sec on average)
pnml2lts-mc( 0/ 4): States per second: 143109, Transitions per second: 690194
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 129.9MB, 8.5 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 47.0%/11.0%
pnml2lts-mc( 0/ 4): Stored 946 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 129.9MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V20P10N20-LTLCardinality-08
ltl formula formula --ltl=/tmp/2331/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 77 places, 926 transitions and 6982 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2331/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2331/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2331/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2331/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 78, there are 932 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~157 levels ~10000 states ~16144 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~20000 states ~32860 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~40000 states ~69048 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~80000 states ~142460 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~160000 states ~290788 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~320000 states ~637776 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~640000 states ~1509060 transitions
pnml2lts-mc( 2/ 4): ~157 levels ~1280000 states ~3639772 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~2560000 states ~7594872 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~5120000 states ~15691736 transitions
pnml2lts-mc( 0/ 4): ~174 levels ~10240000 states ~32967288 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16299489
pnml2lts-mc( 0/ 4): unique states count: 16299489
pnml2lts-mc( 0/ 4): unique transitions count: 56025445
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 40694240
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16789216
pnml2lts-mc( 0/ 4): - cum. max stack depth: 689
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16789216 states 57931956 transitions, fanout: 3.451
pnml2lts-mc( 0/ 4): Total exploration time 99.590 sec (99.590 sec minimum, 99.590 sec on average)
pnml2lts-mc( 0/ 4): States per second: 168583, Transitions per second: 581705
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 131.8MB, 8.5 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 48.0%/11.0%
pnml2lts-mc( 0/ 4): Stored 946 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 131.8MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13
ltl formula formula --ltl=/tmp/2331/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 77 places, 926 transitions and 6982 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2331/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2331/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2331/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2331/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 78, there are 946 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~167!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 471
pnml2lts-mc( 0/ 4): unique states count: 967
pnml2lts-mc( 0/ 4): unique transitions count: 2936
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 16
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 979
pnml2lts-mc( 0/ 4): - cum. max stack depth: 504
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 979 states 2994 transitions, fanout: 3.058
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32633, Transitions per second: 99800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 23.0 B/state, compr.: 7.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 946 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P10N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398600027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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