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-171620398900140.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-V80P50N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398900140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:58 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.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K 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-V80P50N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717219319126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:22:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:22:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:22:00] [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 05:22:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:22:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 545 ms
[2024-06-01 05:22:01] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:22:01] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 05:22:01] [INFO ] Skeletonized 9 HLPN properties in 2 ms. Removed 7 properties that had guard overlaps.
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 5 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.0 ms
RANDOM walk for 716 steps (0 resets) in 13 ms. (51 steps per ms) remains 0/6 properties
[2024-06-01 05:22:01] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:22:01] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:22:01] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 128 ms.
[2024-06-01 05:22:01] [INFO ] Unfolded 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 48 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 05:22:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 05:22:02] [INFO ] Computed 5 invariants in 26 ms
[2024-06-01 05:22:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 05:22:29] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20128 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 55719ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 55773ms
[2024-06-01 05:22:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:57] [INFO ] Invariant cache hit.
[2024-06-01 05:22:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 05:22:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:57] [INFO ] Invariant cache hit.
[2024-06-01 05:22:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:22:58] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-06-01 05:22:58] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-06-01 05:22:58] [INFO ] Invariant cache hit.
[2024-06-01 05:22:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 05:23:25] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 3 ms to minimize.
[2024-06-01 05:23:42] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 2 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 77561ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 77599ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133759 ms. Remains : 186/188 places, 2028/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2024-06-01 05:24:16] [INFO ] Flatten gal took : 261 ms
[2024-06-01 05:24:18] [INFO ] Flatten gal took : 269 ms
[2024-06-01 05:24:19] [INFO ] Input system was already deterministic with 2028 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 29389 steps (41 resets) in 3947 ms. (7 steps per ms) remains 0/16 properties
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 169 stabilizing places and 324 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F((G(p0)||G(p1)))||G(p2))))))'
Support contains 99 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 31 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:24:21] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-06-01 05:24:21] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:24:21] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:24:48] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 56523ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 56555ms
[2024-06-01 05:25:18] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:18] [INFO ] Invariant cache hit.
[2024-06-01 05:25:18] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 05:25:18] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:25:18] [INFO ] Invariant cache hit.
[2024-06-01 05:25:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:25:19] [INFO ] Implicit Places using invariants and state equation in 635 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 821 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 42 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57462 ms. Remains : 185/186 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-01
Stuttering criterion allowed to conclude after 674 steps with 0 reset in 58 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-01 finished in 57958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 83 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 45 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:25:19] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:25:19] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 05:25:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:25:43] [INFO ] Deduced a trap composed of 5 places in 228 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 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54913ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54942ms
[2024-06-01 05:26:14] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:26:14] [INFO ] Invariant cache hit.
[2024-06-01 05:26:14] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 05:26:14] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:26:14] [INFO ] Invariant cache hit.
[2024-06-01 05:26:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:26:15] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 22 ms. Remains 184 /184 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56335 ms. Remains : 184/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 1009 ms.
Product exploration explored 100000 steps with 33333 reset in 922 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-02 finished in 58497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F((X((!p1 U (!p2||G(!p1))))&&p0)))||(p3&&X(p2))))))'
Support contains 98 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 34 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:26:18] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:26:18] [INFO ] Invariant cache hit.
[2024-06-01 05:26:18] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:26:42] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55366ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55441ms
[2024-06-01 05:27:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:27:13] [INFO ] Invariant cache hit.
[2024-06-01 05:27:13] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 05:27:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:27:13] [INFO ] Invariant cache hit.
[2024-06-01 05:27:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:27:14] [INFO ] Implicit Places using invariants and state equation in 784 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 977 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 19 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56479 ms. Remains : 183/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p1 p2 (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
Product exploration explored 100000 steps with 32482 reset in 9677 ms.
Product exploration explored 100000 steps with 32303 reset in 9243 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) p0 p2 p1))), (X (AND (NOT p3) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p0)), (X p0), (X (NOT (AND p3 (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) p0 p2 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) p0 (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 23 factoid took 580 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p1 p2 (NOT p3)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (56 resets) in 9926 ms. (4 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40003 steps (24 resets) in 7651 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 11556 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (28 resets) in 7095 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (24 resets) in 6883 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 7029 ms. (5 steps per ms) remains 5/5 properties
[2024-06-01 05:27:48] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 05:27:48] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:27:48] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 181/551 variables, and 5 constraints, problems are : Problem set: 5 solved, 0 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3849ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) p0 p2 p1))), (X (AND (NOT p3) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p0)), (X p0), (X (NOT (AND p3 (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) p0 p2 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p2 p1)))), (G (OR p0 (NOT p3))), (G (OR p0 (NOT p2) (NOT p3) (NOT p1))), (G (OR (NOT p0) (NOT p2) p3 (NOT p1))), (G (OR p0 (NOT p2) p3 (NOT p1))), (G (OR p0 p2 (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) p0 (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p2 p3))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 977 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 93 out of 183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 322 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:27:54] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:27:54] [INFO ] Invariant cache hit.
[2024-06-01 05:27:54] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:28:19] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 56110ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 56132ms
[2024-06-01 05:28:50] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:28:50] [INFO ] Invariant cache hit.
[2024-06-01 05:28:50] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 05:28:50] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:28:50] [INFO ] Invariant cache hit.
[2024-06-01 05:28:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:28:50] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-06-01 05:28:51] [INFO ] Redundant transitions in 143 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:28:51] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:28:51] [INFO ] Invariant cache hit.
[2024-06-01 05:28:51] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:29:15] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 73794ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 73825ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 131075 ms. Remains : 183/183 places, 2027/2027 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2128 steps (3 resets) in 139 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 225 reset in 4448 ms.
Product exploration explored 100000 steps with 236 reset in 3918 ms.
Support contains 93 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 179 transition count 2024
Applied a total of 7 rules in 239 ms. Remains 179 /183 variables (removed 4) and now considering 2024/2027 (removed 3) transitions.
[2024-06-01 05:30:14] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-06-01 05:30:14] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 05:30:14] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 05:30:14] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 05:30:14] [INFO ] Invariant cache hit.
[2024-06-01 05:30:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:30:14] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 05:30:15] [INFO ] Redundant transitions in 70 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-06-01 05:30:15] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 05:30:15] [INFO ] Invariant cache hit.
[2024-06-01 05:30:15] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
[2024-06-01 05:30:57] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
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 179/544 variables, and 5 constraints, problems are : Problem set: 80 solved, 1941 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1941 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 80 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/544 variables, and 5 constraints, problems are : Problem set: 80 solved, 1941 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2021 constraints, Known Traps: 1/1 constraints]
After SMT, in 73625ms problems are : Problem set: 80 solved, 1941 unsolved
Search for dead transitions found 80 dead transitions in 73652ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/183 places, 1944/2027 transitions.
Applied a total of 0 rules in 205 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-06-01 05:31:29] [INFO ] Redundant transitions in 135 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 74923 ms. Remains : 179/183 places, 1944/2027 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-03 finished in 311518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p1))))))'
Support contains 83 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:31:29] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-06-01 05:31:29] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:31:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54831ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54852ms
[2024-06-01 05:32:24] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:32:24] [INFO ] Invariant cache hit.
[2024-06-01 05:32:24] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-01 05:32:24] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:32:24] [INFO ] Invariant cache hit.
[2024-06-01 05:32:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:32:25] [INFO ] Implicit Places using invariants and state equation in 958 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1237 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 18 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56121 ms. Remains : 184/186 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
Product exploration explored 100000 steps with 4469 reset in 629 ms.
Product exploration explored 100000 steps with 4524 reset in 516 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1083 steps (0 resets) in 16 ms. (63 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 05:32:28] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 05:32:28] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:32:28] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:32:29] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2024-06-01 05:32:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:32:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:32:30] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-01 05:32:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:32:30] [INFO ] [Nat]Added 21 Read/Feed constraints in 265 ms returned sat
[2024-06-01 05:32:31] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 1 ms to minimize.
[2024-06-01 05:32:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2024-06-01 05:32:31] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 113 ms.
[2024-06-01 05:32:31] [INFO ] Added : 12 causal constraints over 6 iterations in 366 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:32:31] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:32:31] [INFO ] Invariant cache hit.
[2024-06-01 05:32:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54358ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54384ms
[2024-06-01 05:33:26] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:33:26] [INFO ] Invariant cache hit.
[2024-06-01 05:33:26] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 05:33:26] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:33:26] [INFO ] Invariant cache hit.
[2024-06-01 05:33:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:33:27] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:33:27] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:33:27] [INFO ] Invariant cache hit.
[2024-06-01 05:33:27] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:33:52] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 75213ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 75241ms
Finished structural reductions in LTL mode , in 1 iterations and 130755 ms. Remains : 184/184 places, 2028/2028 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1070 steps (0 resets) in 18 ms. (56 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 05:34:43] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:34:43] [INFO ] Invariant cache hit.
[2024-06-01 05:34:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:34:44] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-06-01 05:34:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:34:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:34:45] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-01 05:34:45] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:34:46] [INFO ] [Nat]Added 21 Read/Feed constraints in 524 ms returned sat
[2024-06-01 05:34:46] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 138 ms.
[2024-06-01 05:34:46] [INFO ] Added : 15 causal constraints over 6 iterations in 319 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4339 reset in 600 ms.
Product exploration explored 100000 steps with 4524 reset in 462 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 2028
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 1 rules in 170 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:34:48] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 05:34:48] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:34:48] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:35:09] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53212ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53232ms
[2024-06-01 05:35:41] [INFO ] Redundant transitions in 34 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:35:41] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:35:41] [INFO ] Invariant cache hit.
[2024-06-01 05:35:41] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:36:04] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 73983ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 184/184 places, 2028/2028 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127457 ms. Remains : 184/184 places, 2028/2028 transitions.
Support contains 83 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 25 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:36:55] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 05:36:55] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:36:55] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:37:20] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54398ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54434ms
[2024-06-01 05:37:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:37:50] [INFO ] Invariant cache hit.
[2024-06-01 05:37:50] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 05:37:50] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:37:50] [INFO ] Invariant cache hit.
[2024-06-01 05:37:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:37:51] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:37:51] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:37:51] [INFO ] Invariant cache hit.
[2024-06-01 05:37:51] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:38:15] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 74687ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 74719ms
Finished structural reductions in LTL mode , in 1 iterations and 130290 ms. Remains : 184/184 places, 2028/2028 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-04 finished in 456802 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((X(F((p1&&F(!p1))))||p0))))'
Support contains 93 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2024
Applied a total of 9 rules in 386 ms. Remains 181 /186 variables (removed 5) and now considering 2024/2028 (removed 4) transitions.
[2024-06-01 05:39:06] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 181 cols
[2024-06-01 05:39:06] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 05:39:07] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 05:39:07] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 05:39:07] [INFO ] Invariant cache hit.
[2024-06-01 05:39:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:39:07] [INFO ] Implicit Places using invariants and state equation in 816 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1011 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2024/2028 transitions.
Applied a total of 0 rules in 194 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1592 ms. Remains : 179/186 places, 2024/2028 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-05
Stuttering criterion allowed to conclude after 500 steps with 1 reset in 95 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-05 finished in 1892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))&&X(G(p0)))))'
Support contains 94 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 05:39:08] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-06-01 05:39:08] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:39:08] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 05:39:33] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 54174ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 54198ms
[2024-06-01 05:40:02] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:40:02] [INFO ] Invariant cache hit.
[2024-06-01 05:40:02] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 05:40:02] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 05:40:02] [INFO ] Invariant cache hit.
[2024-06-01 05:40:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:40:03] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1183 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55409 ms. Remains : 184/186 places, 2028/2028 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-07
Stuttering criterion allowed to conclude after 4067 steps with 9 reset in 121 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-07 finished in 55760 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((p1&&X(G(p2))))))'
Support contains 95 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 29 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:40:04] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:40:04] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 05:40:04] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:40:29] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54882ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54916ms
[2024-06-01 05:40:59] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:40:59] [INFO ] Invariant cache hit.
[2024-06-01 05:40:59] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 05:40:59] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:40:59] [INFO ] Invariant cache hit.
[2024-06-01 05:40:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:41:00] [INFO ] Implicit Places using invariants and state equation in 841 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 998 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 12 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55963 ms. Remains : 183/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-08 finished in 56191 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)) U (F(p1)&&X(!p2))))'
Support contains 97 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 23 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:41:00] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:41:00] [INFO ] Invariant cache hit.
[2024-06-01 05:41:00] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:41:24] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54883ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54909ms
[2024-06-01 05:41:55] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:41:55] [INFO ] Invariant cache hit.
[2024-06-01 05:41:55] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 05:41:55] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:41:55] [INFO ] Invariant cache hit.
[2024-06-01 05:41:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:41:56] [INFO ] Implicit Places using invariants and state equation in 950 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56085 ms. Remains : 184/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p2), (NOT p1), p2, true, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-09 finished in 56322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(p0) U p1)))))'
Support contains 174 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 29 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:41:56] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:41:56] [INFO ] Invariant cache hit.
[2024-06-01 05:41:56] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:42:22] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55711ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55748ms
[2024-06-01 05:42:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:42:52] [INFO ] Invariant cache hit.
[2024-06-01 05:42:52] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 05:42:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:42:52] [INFO ] Invariant cache hit.
[2024-06-01 05:42:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:42:53] [INFO ] Implicit Places using invariants and state equation in 812 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 949 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 11 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56746 ms. Remains : 183/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-10
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 17 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-10 finished in 56883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&G(p1))))))'
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 19 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:42:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:42:53] [INFO ] Invariant cache hit.
[2024-06-01 05:42:53] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:43:17] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54834ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54858ms
[2024-06-01 05:43:48] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:43:48] [INFO ] Invariant cache hit.
[2024-06-01 05:43:48] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 05:43:48] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:43:48] [INFO ] Invariant cache hit.
[2024-06-01 05:43:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:43:49] [INFO ] Implicit Places using invariants and state equation in 977 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1276 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56175 ms. Remains : 183/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
Product exploration explored 100000 steps with 376 reset in 797 ms.
Product exploration explored 100000 steps with 375 reset in 639 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (56 resets) in 635 ms. (62 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (24 resets) in 482 ms. (82 steps per ms) remains 1/1 properties
[2024-06-01 05:43:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 05:43:52] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 05:43:52] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 85/551 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
[2024-06-01 05:43:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:43:52] [INFO ] Invariant cache hit.
[2024-06-01 05:43:54] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-06-01 05:43:54] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-01 05:43:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:43:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-01 05:43:55] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-01 05:43:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:43:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 210 ms returned sat
[2024-06-01 05:43:56] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 82 ms.
[2024-06-01 05:43:56] [INFO ] Added : 12 causal constraints over 4 iterations in 283 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 85 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 2026
Applied a total of 3 rules in 319 ms. Remains 181 /183 variables (removed 2) and now considering 2026/2027 (removed 1) transitions.
[2024-06-01 05:43:56] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 181 cols
[2024-06-01 05:43:56] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 05:43:56] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-01 05:43:56] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 05:43:56] [INFO ] Invariant cache hit.
[2024-06-01 05:43:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:43:57] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2024-06-01 05:43:57] [INFO ] Redundant transitions in 46 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-06-01 05:43:57] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 05:43:57] [INFO ] Invariant cache hit.
[2024-06-01 05:43:57] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 05:44:21] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2024-06-01 05:44:23] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/548 variables, and 6 constraints, problems are : Problem set: 80 solved, 1943 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/6 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/6 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 3 (OVERLAPS) 367/548 variables, 181/187 constraints. Problems are: Problem set: 82 solved, 1941 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 21/208 constraints. Problems are: Problem set: 82 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 2149 constraints, problems are : Problem set: 82 solved, 1941 unsolved in 33615 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1941/2023 constraints, Known Traps: 2/2 constraints]
After SMT, in 78586ms problems are : Problem set: 82 solved, 1941 unsolved
Search for dead transitions found 82 dead transitions in 78617ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/183 places, 1944/2027 transitions.
Applied a total of 0 rules in 176 ms. Remains 181 /181 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-06-01 05:45:16] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 80295 ms. Remains : 181/183 places, 1944/2027 transitions.
Computed a total of 164 stabilizing places and 320 stable transitions
Computed a total of 164 stabilizing places and 320 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 146 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (76 resets) in 657 ms. (60 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (40 resets) in 542 ms. (73 steps per ms) remains 1/1 properties
[2024-06-01 05:45:17] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
// Phase 1: matrix 364 rows 181 cols
[2024-06-01 05:45:17] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 05:45:17] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 85/545 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 375 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
[2024-06-01 05:45:18] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2024-06-01 05:45:18] [INFO ] Invariant cache hit.
[2024-06-01 05:45:20] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 05:45:20] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-06-01 05:45:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:45:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 05:45:22] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-06-01 05:45:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:22] [INFO ] [Nat]Added 20 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:45:22] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 554 ms
[2024-06-01 05:45:23] [INFO ] Computed and/alt/rep : 168/336/168 causal constraints (skipped 193 transitions) in 78 ms.
[2024-06-01 05:45:24] [INFO ] Added : 56 causal constraints over 13 iterations in 996 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
Product exploration explored 100000 steps with 424 reset in 519 ms.
Product exploration explored 100000 steps with 421 reset in 557 ms.
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 1944/1944 transitions.
Applied a total of 0 rules in 115 ms. Remains 181 /181 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-06-01 05:45:25] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2024-06-01 05:45:25] [INFO ] Invariant cache hit.
[2024-06-01 05:45:25] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-01 05:45:25] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2024-06-01 05:45:25] [INFO ] Invariant cache hit.
[2024-06-01 05:45:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:26] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-06-01 05:45:26] [INFO ] Redundant transitions in 51 ms returned []
Running 1941 sub problems to find dead transitions.
[2024-06-01 05:45:26] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2024-06-01 05:45:26] [INFO ] Invariant cache hit.
[2024-06-01 05:45:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
[2024-06-01 05:45:46] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/545 variables, and 5 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1941/1941 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/545 variables, and 5 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 1/1 constraints]
After SMT, in 72214ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 72239ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73327 ms. Remains : 181/181 places, 1944/1944 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-11 finished in 225694 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 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Applied a total of 5 rules in 187 ms. Remains 183 /186 variables (removed 3) and now considering 2026/2028 (removed 2) transitions.
[2024-06-01 05:46:39] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 183 cols
[2024-06-01 05:46:39] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 05:46:39] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 05:46:39] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 05:46:39] [INFO ] Invariant cache hit.
[2024-06-01 05:46:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:46:41] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1779 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/186 places, 2026/2028 transitions.
Applied a total of 0 rules in 170 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2137 ms. Remains : 181/186 places, 2026/2028 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-12
Product exploration explored 100000 steps with 194 reset in 571 ms.
Product exploration explored 100000 steps with 194 reset in 581 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
RANDOM walk for 248 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2026/2026 transitions.
Applied a total of 0 rules in 174 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-06-01 05:46:43] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 181 cols
[2024-06-01 05:46:43] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 05:46:43] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 05:46:43] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 05:46:43] [INFO ] Invariant cache hit.
[2024-06-01 05:46:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:46:44] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2024-06-01 05:46:44] [INFO ] Redundant transitions in 65 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-06-01 05:46:44] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 05:46:44] [INFO ] Invariant cache hit.
[2024-06-01 05:46:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 05:47:09] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2024-06-01 05:47:11] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/548 variables, and 6 constraints, problems are : Problem set: 80 solved, 1943 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/6 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/6 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 3 (OVERLAPS) 367/548 variables, 181/187 constraints. Problems are: Problem set: 82 solved, 1941 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 21/208 constraints. Problems are: Problem set: 82 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 2149 constraints, problems are : Problem set: 82 solved, 1941 unsolved in 34159 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1941/2023 constraints, Known Traps: 2/2 constraints]
After SMT, in 80372ms problems are : Problem set: 82 solved, 1941 unsolved
Search for dead transitions found 82 dead transitions in 80400ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/181 places, 1944/2026 transitions.
Applied a total of 0 rules in 136 ms. Remains 181 /181 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-06-01 05:48:05] [INFO ] Redundant transitions in 29 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 82257 ms. Remains : 181/181 places, 1944/2026 transitions.
Computed a total of 164 stabilizing places and 320 stable transitions
Computed a total of 164 stabilizing places and 320 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
RANDOM walk for 265 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
Product exploration explored 100000 steps with 194 reset in 781 ms.
Product exploration explored 100000 steps with 194 reset in 631 ms.
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 1944/1944 transitions.
Applied a total of 0 rules in 144 ms. Remains 181 /181 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-06-01 05:48:07] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
// Phase 1: matrix 364 rows 181 cols
[2024-06-01 05:48:07] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 05:48:07] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 05:48:07] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2024-06-01 05:48:07] [INFO ] Invariant cache hit.
[2024-06-01 05:48:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:48:08] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-06-01 05:48:08] [INFO ] Redundant transitions in 51 ms returned []
Running 1941 sub problems to find dead transitions.
[2024-06-01 05:48:08] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2024-06-01 05:48:08] [INFO ] Invariant cache hit.
[2024-06-01 05:48:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
[2024-06-01 05:48:30] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/545 variables, and 5 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1941/1941 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/545 variables, and 5 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 1/1 constraints]
After SMT, in 74461ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 74492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75830 ms. Remains : 181/181 places, 1944/1944 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-12 finished in 164096 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' '!((p0 U X(G(p1))))'
Support contains 165 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 24 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:49:23] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:49:23] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:49:23] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:49:47] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55297ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55328ms
[2024-06-01 05:50:18] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:50:18] [INFO ] Invariant cache hit.
[2024-06-01 05:50:18] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 05:50:18] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:50:18] [INFO ] Invariant cache hit.
[2024-06-01 05:50:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:50:19] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:50:19] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:50:19] [INFO ] Invariant cache hit.
[2024-06-01 05:50:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 77652ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 77674ms
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2027/2028 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133720 ms. Remains : 185/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-13 finished in 133849 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(p1) U p2)&&G(p1))||p0)))'
Support contains 94 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 188 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:51:37] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:51:37] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:51:37] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:52:01] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55715ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55743ms
[2024-06-01 05:52:33] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:52:33] [INFO ] Invariant cache hit.
[2024-06-01 05:52:33] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 05:52:33] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:52:33] [INFO ] Invariant cache hit.
[2024-06-01 05:52:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:52:34] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1257 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 204 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57398 ms. Remains : 183/186 places, 2027/2028 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-14 finished in 57643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F((X((!p1 U (!p2||G(!p1))))&&p0)))||(p3&&X(p2))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
Stuttering acceptance computed with spot in 191 ms :[(OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p1 p2 (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 98 out of 186 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 50 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:52:35] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:52:35] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:52:35] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:53:02] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 57281ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 57312ms
[2024-06-01 05:53:32] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:53:32] [INFO ] Invariant cache hit.
[2024-06-01 05:53:32] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 05:53:32] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:53:32] [INFO ] Invariant cache hit.
[2024-06-01 05:53:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:53:33] [INFO ] Implicit Places using invariants and state equation in 608 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 786 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 36 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 58194 ms. Remains : 183/186 places, 2027/2028 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
Product exploration timeout after 96160 steps with 31202 reset in 10001 ms.
Product exploration explored 100000 steps with 32357 reset in 9650 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) p0 p2 p1))), (X (AND (NOT p3) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p0)), (X p0), (X (NOT (AND p3 (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) p0 p2 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) p0 (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 23 factoid took 702 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND p1 p2 (NOT p3)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (56 resets) in 9944 ms. (4 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 7260 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 10932 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (28 resets) in 7716 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 7361 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (24 resets) in 7150 ms. (5 steps per ms) remains 5/5 properties
[2024-06-01 05:54:07] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 05:54:07] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:54:07] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 181/551 variables, and 5 constraints, problems are : Problem set: 5 solved, 0 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5977ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) p0 p2 p1))), (X (AND (NOT p3) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p0)), (X p0), (X (NOT (AND p3 (NOT p0) p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) p0 p2 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p2 p1)))), (G (OR p0 (NOT p3))), (G (OR p0 (NOT p2) (NOT p3) (NOT p1))), (G (OR (NOT p0) (NOT p2) p3 (NOT p1))), (G (OR p0 (NOT p2) p3 (NOT p1))), (G (OR p0 p2 (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) p0 (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p2 p3))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1047 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 93 out of 183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 222 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:54:14] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:54:39] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55074ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55099ms
[2024-06-01 05:55:09] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:55:09] [INFO ] Invariant cache hit.
[2024-06-01 05:55:10] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 05:55:10] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:55:10] [INFO ] Invariant cache hit.
[2024-06-01 05:55:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:55:10] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-06-01 05:55:10] [INFO ] Redundant transitions in 71 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:55:10] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:55:10] [INFO ] Invariant cache hit.
[2024-06-01 05:55:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:55:35] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 75675ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 75711ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 131670 ms. Remains : 183/183 places, 2027/2027 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2118 steps (3 resets) in 164 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 222 reset in 3953 ms.
Product exploration explored 100000 steps with 221 reset in 3635 ms.
Support contains 93 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 179 transition count 2024
Applied a total of 7 rules in 186 ms. Remains 179 /183 variables (removed 4) and now considering 2024/2027 (removed 3) transitions.
[2024-06-01 05:56:35] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-06-01 05:56:35] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 05:56:35] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 05:56:35] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 05:56:35] [INFO ] Invariant cache hit.
[2024-06-01 05:56:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:56:35] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-06-01 05:56:36] [INFO ] Redundant transitions in 81 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-06-01 05:56:36] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 05:56:36] [INFO ] Invariant cache hit.
[2024-06-01 05:56:36] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
[2024-06-01 05:57:16] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 4 ms to minimize.
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/544 variables, and 5 constraints, problems are : Problem set: 80 solved, 1941 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1941 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 80 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/544 variables, and 5 constraints, problems are : Problem set: 80 solved, 1941 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2021 constraints, Known Traps: 1/1 constraints]
After SMT, in 74620ms problems are : Problem set: 80 solved, 1941 unsolved
Search for dead transitions found 80 dead transitions in 74649ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/183 places, 1944/2027 transitions.
Applied a total of 0 rules in 200 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2024-06-01 05:57:50] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 75911 ms. Remains : 179/183 places, 1944/2027 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-03 finished in 316536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 83 out of 186 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 2027
Applied a total of 2 rules in 34 ms. Remains 185 /186 variables (removed 1) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:57:51] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-06-01 05:57:51] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:57:51] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:58:14] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54334ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54361ms
[2024-06-01 05:58:46] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:58:46] [INFO ] Invariant cache hit.
[2024-06-01 05:58:46] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-01 05:58:46] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:58:46] [INFO ] Invariant cache hit.
[2024-06-01 05:58:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:58:47] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1278 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 183/186 places, 2027/2028 transitions.
Applied a total of 0 rules in 30 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 55710 ms. Remains : 183/186 places, 2027/2028 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
Product exploration explored 100000 steps with 4873 reset in 516 ms.
Product exploration explored 100000 steps with 4891 reset in 465 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2027 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1023 steps (0 resets) in 21 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 332 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 05:58:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 05:58:49] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:58:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:58:50] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-06-01 05:58:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:58:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:58:51] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2024-06-01 05:58:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:58:52] [INFO ] [Nat]Added 21 Read/Feed constraints in 833 ms returned sat
[2024-06-01 05:58:52] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 80 ms.
[2024-06-01 05:58:53] [INFO ] Added : 12 causal constraints over 3 iterations in 299 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 83 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 14 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:58:53] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:58:53] [INFO ] Invariant cache hit.
[2024-06-01 05:58:53] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 05:59:17] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 55664ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 55697ms
[2024-06-01 05:59:48] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:59:48] [INFO ] Invariant cache hit.
[2024-06-01 05:59:49] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 05:59:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:59:49] [INFO ] Invariant cache hit.
[2024-06-01 05:59:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 05:59:49] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 2024 sub problems to find dead transitions.
[2024-06-01 05:59:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 05:59:49] [INFO ] Invariant cache hit.
[2024-06-01 05:59:49] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:00:13] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
SMT process timed out in 74967ms, After SMT, problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 75008ms
Finished structural reductions in LTL mode , in 1 iterations and 131551 ms. Remains : 183/183 places, 2027/2027 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2027 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 993 steps (0 resets) in 20 ms. (47 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 06:01:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:01:05] [INFO ] Invariant cache hit.
[2024-06-01 06:01:06] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:01:06] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2024-06-01 06:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:01:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:01:07] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-06-01 06:01:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:01:08] [INFO ] [Nat]Added 21 Read/Feed constraints in 796 ms returned sat
[2024-06-01 06:01:08] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 69 ms.
[2024-06-01 06:01:09] [INFO ] Added : 12 causal constraints over 3 iterations in 257 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4738 reset in 622 ms.
Product exploration explored 100000 steps with 5000 reset in 559 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 83 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 174 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:01:10] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:01:10] [INFO ] Invariant cache hit.
[2024-06-01 06:01:10] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:01:34] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54439ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54468ms
[2024-06-01 06:02:05] [INFO ] Redundant transitions in 34 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:02:05] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:02:05] [INFO ] Invariant cache hit.
[2024-06-01 06:02:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:02:27] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 73369ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 73389ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128083 ms. Remains : 183/183 places, 2027/2027 transitions.
Support contains 83 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 8 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:03:18] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:03:18] [INFO ] Invariant cache hit.
[2024-06-01 06:03:18] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:03:41] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 54347ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 54367ms
[2024-06-01 06:04:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:04:13] [INFO ] Invariant cache hit.
[2024-06-01 06:04:13] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 06:04:13] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:04:13] [INFO ] Invariant cache hit.
[2024-06-01 06:04:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:04:14] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:04:14] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:04:14] [INFO ] Invariant cache hit.
[2024-06-01 06:04:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:04:36] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 73544ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 73588ms
Finished structural reductions in LTL mode , in 1 iterations and 129202 ms. Remains : 183/183 places, 2027/2027 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-04 finished in 456997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&G(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Applied a total of 5 rules in 53 ms. Remains 183 /186 variables (removed 3) and now considering 2026/2028 (removed 2) transitions.
[2024-06-01 06:05:28] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 183 cols
[2024-06-01 06:05:28] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 06:05:29] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 06:05:29] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:05:29] [INFO ] Invariant cache hit.
[2024-06-01 06:05:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:05:30] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1352 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 181/186 places, 2026/2028 transitions.
Applied a total of 0 rules in 31 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1439 ms. Remains : 181/186 places, 2026/2028 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
Product exploration explored 100000 steps with 424 reset in 704 ms.
Product exploration explored 100000 steps with 422 reset in 547 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (76 resets) in 573 ms. (69 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (40 resets) in 388 ms. (102 steps per ms) remains 1/1 properties
[2024-06-01 06:05:32] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 181 cols
[2024-06-01 06:05:32] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 06:05:32] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 85/548 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
[2024-06-01 06:05:32] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:05:32] [INFO ] Invariant cache hit.
[2024-06-01 06:05:34] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-06-01 06:05:34] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 06:05:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:05:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 06:05:35] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 06:05:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:05:36] [INFO ] [Nat]Added 21 Read/Feed constraints in 76 ms returned sat
[2024-06-01 06:05:36] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 194 transitions) in 66 ms.
[2024-06-01 06:05:36] [INFO ] Added : 12 causal constraints over 3 iterations in 193 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2026/2026 transitions.
Applied a total of 0 rules in 179 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-06-01 06:05:36] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:05:36] [INFO ] Invariant cache hit.
[2024-06-01 06:05:36] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 06:05:36] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:05:36] [INFO ] Invariant cache hit.
[2024-06-01 06:05:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:05:37] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2024-06-01 06:05:37] [INFO ] Redundant transitions in 46 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-06-01 06:05:37] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:05:37] [INFO ] Invariant cache hit.
[2024-06-01 06:05:37] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 06:06:00] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2024-06-01 06:06:03] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/548 variables, and 6 constraints, problems are : Problem set: 80 solved, 1943 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/6 constraints. Problems are: Problem set: 80 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/548 variables, and 6 constraints, problems are : Problem set: 80 solved, 1943 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2023 constraints, Known Traps: 2/2 constraints]
After SMT, in 74415ms problems are : Problem set: 80 solved, 1943 unsolved
Search for dead transitions found 80 dead transitions in 74441ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/181 places, 1946/2026 transitions.
Applied a total of 0 rules in 117 ms. Remains 181 /181 variables (removed 0) and now considering 1946/1946 (removed 0) transitions.
[2024-06-01 06:06:52] [INFO ] Redundant transitions in 30 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 75963 ms. Remains : 181/181 places, 1946/2026 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
RANDOM walk for 40000 steps (76 resets) in 488 ms. (81 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (40 resets) in 501 ms. (79 steps per ms) remains 1/1 properties
[2024-06-01 06:06:52] [INFO ] Flow matrix only has 366 transitions (discarded 1580 similar events)
// Phase 1: matrix 366 rows 181 cols
[2024-06-01 06:06:52] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 06:06:52] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 85/547 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 299 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
[2024-06-01 06:06:53] [INFO ] Flow matrix only has 366 transitions (discarded 1580 similar events)
[2024-06-01 06:06:53] [INFO ] Invariant cache hit.
[2024-06-01 06:06:55] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 06:06:55] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2024-06-01 06:06:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:06:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 06:06:57] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-01 06:06:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:06:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 126 ms returned sat
[2024-06-01 06:06:57] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2024-06-01 06:06:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-06-01 06:06:57] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 193 transitions) in 55 ms.
[2024-06-01 06:06:58] [INFO ] Added : 57 causal constraints over 12 iterations in 458 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false]
Product exploration explored 100000 steps with 423 reset in 510 ms.
Product exploration explored 100000 steps with 424 reset in 512 ms.
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 1946/1946 transitions.
Applied a total of 0 rules in 156 ms. Remains 181 /181 variables (removed 0) and now considering 1946/1946 (removed 0) transitions.
[2024-06-01 06:06:59] [INFO ] Flow matrix only has 366 transitions (discarded 1580 similar events)
[2024-06-01 06:06:59] [INFO ] Invariant cache hit.
[2024-06-01 06:06:59] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 06:06:59] [INFO ] Flow matrix only has 366 transitions (discarded 1580 similar events)
[2024-06-01 06:06:59] [INFO ] Invariant cache hit.
[2024-06-01 06:06:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:07:00] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-06-01 06:07:00] [INFO ] Redundant transitions in 63 ms returned []
Running 1943 sub problems to find dead transitions.
[2024-06-01 06:07:00] [INFO ] Flow matrix only has 366 transitions (discarded 1580 similar events)
[2024-06-01 06:07:00] [INFO ] Invariant cache hit.
[2024-06-01 06:07:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
[2024-06-01 06:07:21] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 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 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/547 variables, and 5 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1943/1943 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/547 variables, and 5 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1943 constraints, Known Traps: 1/1 constraints]
After SMT, in 72837ms problems are : Problem set: 0 solved, 1943 unsolved
Search for dead transitions found 0 dead transitions in 72864ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74017 ms. Remains : 181/181 places, 1946/1946 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLFireability-11 finished in 165431 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)))'
[2024-06-01 06:08:14] [INFO ] Flatten gal took : 144 ms
[2024-06-01 06:08:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 37 ms.
[2024-06-01 06:08:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 186 places, 2028 transitions and 15308 arcs took 22 ms.
Total runtime 2773848 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N10-LTLFireability-12

BK_STOP 1717222200326

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BridgeAndVehicles-COL-V80P50N10-LTLFireability-03
ltl formula formula --ltl=/tmp/2818/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 186 places, 2028 transitions and 15308 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.320 real 0.070 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2818/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2818/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2818/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2818/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name BridgeAndVehicles-COL-V80P50N10-LTLFireability-04
ltl formula formula --ltl=/tmp/2818/ltl_1_
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 186 places, 2028 transitions and 15308 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.230 real 0.080 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2818/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2818/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2818/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2818/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa64f4) [0x5568245034f4]
1: pnml2lts-mc(+0xa6596) [0x556824503596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7fc172b11050]
3: pnml2lts-mc(+0x430585) [0x55682488d585]
4: pnml2lts-mc(+0x1708c9) [0x5568245cd8c9]
5: pnml2lts-mc(+0x169cd4) [0x5568245c6cd4]
6: pnml2lts-mc(+0x27153f) [0x5568246ce53f]
0: pnml2lts-mc(+0xa64f4) [0x5568245034f4]
7: pnml2lts-mc(+0xba280) [0x556824517280]
0: pnml2lts-mc(+0xa64f4) [0x5568245034f4]
1: pnml2lts-mc(+0xa6596) [0x556824503596]
1: pnml2lts-mc(+0xa6596) [0x556824503596]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7fc172b11050]
2: /lib/x86_64-linux-gnu/libc.so.6(+0x3c050) [0x7fc172b11050]
3: pnml2lts-mc(+0x430585) [0x55682488d585]
3: pnml2lts-mc(+0x430585) [0x55682488d585]
4: pnml2lts-mc(+0x1708c9) [0x5568245cd8c9]
4: pnml2lts-mc(+0x1708c9) [0x5568245cd8c9]
5: pnml2lts-mc(+0x169cd4) [0x5568245c6cd4]
5: pnml2lts-mc(+0x169cd4) [0x5568245c6cd4]
6: pnml2lts-mc(+0x27153f) [0x5568246ce53f]
6: pnml2lts-mc(+0x27153f) [0x5568246ce53f]
7: pnml2lts-mc(+0xba280) [0x556824517280]
7: pnml2lts-mc(+0xba280) [0x556824517280]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7fc172b1355d]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7fc172b1355d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7fc172b1369a]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7fc172b1369a]
10: pnml2lts-mc(+0xa5681) [0x556824502681]
10: pnml2lts-mc(+0xa5681) [0x556824502681]
11: pnml2lts-mc(+0xa5a10) [0x556824502a10]
11: pnml2lts-mc(+0xa5a10) [0x556824502a10]
12: pnml2lts-mc(+0xa73a2) [0x5568245043a2]
12: pnml2lts-mc(+0xa73a2) [0x5568245043a2]
13: pnml2lts-mc(+0x92139) [0x5568244ef139]
13: pnml2lts-mc(+0x92139) [0x5568244ef139]
14: pnml2lts-mc(+0x9311d) [0x5568244f011d]
14: pnml2lts-mc(+0x9311d) [0x5568244f011d]
15: pnml2lts-mc(+0x83fdb) [0x5568244e0fdb]
15: pnml2lts-mc(+0x83fdb) [0x5568244e0fdb]
16: pnml2lts-mc(+0x64a5d) [0x5568244c1a5d]
16: pnml2lts-mc(+0x64a5d) [0x5568244c1a5d]
17: pnml2lts-mc(+0x64af0) [0x5568244c1af0]
17: pnml2lts-mc(+0x64af0) [0x5568244c1af0]
18: pnml2lts-mc(+0x62aca) [0x5568244bfaca]
18: pnml2lts-mc(+0x62aca) [0x5568244bfaca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7fc172afc24a]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7fc172afc24a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7fc172afc305]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7fc172afc305]
21: pnml2lts-mc(+0x6485e) [0x5568244c185e]
21: pnml2lts-mc(+0x6485e) [0x5568244c185e]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3e55d) [0x7fc172b1355d]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3e69a) [0x7fc172b1369a]
10: pnml2lts-mc(+0xa5681) [0x556824502681]
11: pnml2lts-mc(+0xa5a10) [0x556824502a10]
12: pnml2lts-mc(+0xa73a2) [0x5568245043a2]
13: pnml2lts-mc(+0x92139) [0x5568244ef139]
14: pnml2lts-mc(+0x9311d) [0x5568244f011d]
15: pnml2lts-mc(+0x83fdb) [0x5568244e0fdb]
16: pnml2lts-mc(+0x64a5d) [0x5568244c1a5d]
17: pnml2lts-mc(+0x64af0) [0x5568244c1af0]
18: pnml2lts-mc(+0x62aca) [0x5568244bfaca]
19: /lib/x86_64-linux-gnu/libc.so.6(+0x2724a) [0x7fc172afc24a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0x85) [0x7fc172afc305]
21: pnml2lts-mc(+0x6485e) [0x5568244c185e]
ltl formula name BridgeAndVehicles-COL-V80P50N10-LTLFireability-11
ltl formula formula --ltl=/tmp/2818/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 186 places, 2028 transitions and 15308 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.220 real 0.080 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2818/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2818/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2818/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2818/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-COL-V80P50N10-LTLFireability-12
ltl formula formula --ltl=/tmp/2818/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 186 places, 2028 transitions and 15308 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.220 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2818/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2818/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2818/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2818/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 188 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 2036 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): ~677 levels ~10000 states ~24556 transitions
pnml2lts-mc( 0/ 4): ~677 levels ~20000 states ~62640 transitions
pnml2lts-mc( 0/ 4): ~677 levels ~40000 states ~139224 transitions
pnml2lts-mc( 3/ 4): ~667 levels ~80000 states ~296728 transitions
pnml2lts-mc( 3/ 4): ~675 levels ~160000 states ~597648 transitions
pnml2lts-mc( 3/ 4): ~675 levels ~320000 states ~1201008 transitions
pnml2lts-mc( 3/ 4): ~675 levels ~640000 states ~2421160 transitions
pnml2lts-mc( 3/ 4): ~675 levels ~1280000 states ~4878056 transitions
pnml2lts-mc( 3/ 4): ~675 levels ~2560000 states ~9817188 transitions
pnml2lts-mc( 0/ 4): ~677 levels ~5120000 states ~19315276 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6115059
pnml2lts-mc( 0/ 4): unique states count: 6116890
pnml2lts-mc( 0/ 4): unique transitions count: 25199735
pnml2lts-mc( 0/ 4): - self-loop count: 38
pnml2lts-mc( 0/ 4): - claim dead count: 19679979
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6454119
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2709
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6454119 states 26540652 transitions, fanout: 4.112
pnml2lts-mc( 0/ 4): Total exploration time 98.360 sec (98.340 sec minimum, 98.345 sec on average)
pnml2lts-mc( 0/ 4): States per second: 65617, Transitions per second: 269832
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 110.7MB, 19.0 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2085 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 110.7MB (~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-V80P50N10"
export BK_EXAMINATION="LTLFireability"
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-V80P50N10, examination is LTLFireability"
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-171620398900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;