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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-PT-V20P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717220411843

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:40:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:40:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:40:13] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-01 05:40:13] [INFO ] Transformed 108 places.
[2024-06-01 05:40:13] [INFO ] Transformed 2228 transitions.
[2024-06-01 05:40:13] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 41 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 05:40:13] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-06-01 05:40:13] [INFO ] Computed 5 invariants in 14 ms
[2024-06-01 05:40:13] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:40:36] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 20 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 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:41:04] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 55634ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 55686ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-06-01 05:41:09] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:41:09] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:41:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 05:41:09] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:41:09] [INFO ] Invariant cache hit.
[2024-06-01 05:41:09] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:41:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55951 ms. Remains : 106/108 places, 2208/2228 transitions.
Support contains 105 out of 106 places after structural reductions.
[2024-06-01 05:41:10] [INFO ] Flatten gal took : 229 ms
[2024-06-01 05:41:10] [INFO ] Flatten gal took : 168 ms
[2024-06-01 05:41:11] [INFO ] Input system was already deterministic with 2208 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (228 resets) in 3948 ms. (10 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (108 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (100 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
[2024-06-01 05:41:12] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:41:12] [INFO ] Invariant cache hit.
[2024-06-01 05:41:12] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/393 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/395 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/393 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/395 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/395 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2191 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
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 103 transition count 2206
Applied a total of 5 rules in 372 ms. Remains 103 /106 variables (removed 3) and now considering 2206/2208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 103/106 places, 2206/2208 transitions.
RANDOM walk for 40000 steps (316 resets) in 648 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (164 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (164 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 270283 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 270283 steps, saw 77125 distinct states, run finished after 3005 ms. (steps per millisecond=89 ) properties seen :0
[2024-06-01 05:41:20] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 103 cols
[2024-06-01 05:41:20] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 05:41:20] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/390 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1280ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1630 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 187 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 103/103 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 166 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-06-01 05:41:23] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:41:23] [INFO ] Invariant cache hit.
[2024-06-01 05:41:23] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-06-01 05:41:23] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:41:23] [INFO ] Invariant cache hit.
[2024-06-01 05:41:23] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:41:24] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1558 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 169 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1894 ms. Remains : 101/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 701 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (164 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (164 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 242732 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 242732 steps, saw 69734 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-01 05:41:28] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 101 cols
[2024-06-01 05:41:28] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 05:41:28] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/386 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/388 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/386 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/388 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1977 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 239 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 101/101 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 234 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-06-01 05:41:31] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:41:31] [INFO ] Invariant cache hit.
[2024-06-01 05:41:32] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 05:41:32] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:41:32] [INFO ] Invariant cache hit.
[2024-06-01 05:41:32] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:41:33] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2024-06-01 05:41:33] [INFO ] Redundant transitions in 148 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-06-01 05:41:33] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:41:33] [INFO ] Invariant cache hit.
[2024-06-01 05:41:33] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
[2024-06-01 05:41:53] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/388 variables, and 5 constraints, problems are : Problem set: 0 solved, 2203 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2203/2203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 3 (OVERLAPS) 287/388 variables, 101/106 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 101/207 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 2408 constraints, problems are : Problem set: 2 solved, 2201 unsolved in 34505 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2201/2203 constraints, Known Traps: 1/1 constraints]
After SMT, in 79152ms problems are : Problem set: 2 solved, 2201 unsolved
Search for dead transitions found 2 dead transitions in 79179ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 2204/2206 transitions.
Applied a total of 0 rules in 239 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-06-01 05:42:52] [INFO ] Redundant transitions in 125 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81329 ms. Remains : 101/101 places, 2204/2206 transitions.
Computed a total of 49 stabilizing places and 84 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' '!(F((!p0 U (p1||G(!p0)))))'
Support contains 75 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2206
Applied a total of 5 rules in 559 ms. Remains 103 /106 variables (removed 3) and now considering 2206/2208 (removed 2) transitions.
[2024-06-01 05:42:54] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 103 cols
[2024-06-01 05:42:54] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 05:42:54] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 05:42:54] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:42:54] [INFO ] Invariant cache hit.
[2024-06-01 05:42:54] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:42:54] [INFO ] Implicit Places using invariants and state equation in 739 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 920 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/106 places, 2206/2208 transitions.
Applied a total of 0 rules in 300 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1781 ms. Remains : 101/106 places, 2206/2208 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-00
Product exploration explored 100000 steps with 24998 reset in 7046 ms.
Product exploration explored 100000 steps with 25057 reset in 6745 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND p0 (NOT p1))]
RANDOM walk for 975 steps (5 resets) in 55 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND p0 (NOT p1))]
[2024-06-01 05:43:10] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 101 cols
[2024-06-01 05:43:10] [INFO ] Computed 4 invariants in 4 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:43:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND p0 (NOT p1))
Could not prove EG (AND p0 (NOT p1))
Support contains 75 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 201 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-06-01 05:43:30] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:43:30] [INFO ] Invariant cache hit.
[2024-06-01 05:43:30] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 05:43:30] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:43:30] [INFO ] Invariant cache hit.
[2024-06-01 05:43:31] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:43:31] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-06-01 05:43:31] [INFO ] Redundant transitions in 70 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-06-01 05:43:31] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:43:31] [INFO ] Invariant cache hit.
[2024-06-01 05:43:31] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
[2024-06-01 05:43:52] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/388 variables, and 5 constraints, problems are : Problem set: 0 solved, 2203 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2203/2203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 3 (OVERLAPS) 287/388 variables, 101/106 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 101/207 constraints. Problems are: Problem set: 2 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 2408 constraints, problems are : Problem set: 2 solved, 2201 unsolved in 34869 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2201/2203 constraints, Known Traps: 1/1 constraints]
After SMT, in 80286ms problems are : Problem set: 2 solved, 2201 unsolved
Search for dead transitions found 2 dead transitions in 80312ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/101 places, 2204/2206 transitions.
Applied a total of 0 rules in 211 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-06-01 05:44:52] [INFO ] Redundant transitions in 91 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 81468 ms. Remains : 101/101 places, 2204/2206 transitions.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND p0 (NOT p1))]
RANDOM walk for 1229 steps (7 resets) in 90 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 412 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
[2024-06-01 05:44:53] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 101 cols
[2024-06-01 05:44:53] [INFO ] Computed 4 invariants in 4 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:45:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND p0 (NOT p1))
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25186 reset in 3831 ms.
Product exploration explored 100000 steps with 25070 reset in 3597 ms.
Support contains 75 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 194 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-06-01 05:45:20] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:45:20] [INFO ] Invariant cache hit.
[2024-06-01 05:45:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 05:45:20] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:45:20] [INFO ] Invariant cache hit.
[2024-06-01 05:45:21] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:45:21] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-06-01 05:45:21] [INFO ] Redundant transitions in 64 ms returned []
Running 2201 sub problems to find dead transitions.
[2024-06-01 05:45:21] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-06-01 05:45:21] [INFO ] Invariant cache hit.
[2024-06-01 05:45:21] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
[2024-06-01 05:45:41] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 1 ms to minimize.
[2024-06-01 05:45:41] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2024-06-01 05:45:43] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1113 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 101/386 variables, and 7 constraints, problems are : Problem set: 20 solved, 2181 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2201/2201 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 20 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 2181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 20 solved, 2181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 2181 unsolved
At refinement iteration 3 (OVERLAPS) 285/386 variables, 101/108 constraints. Problems are: Problem set: 20 solved, 2181 unsolved
SMT process timed out in 74609ms, After SMT, problems are : Problem set: 20 solved, 2181 unsolved
Search for dead transitions found 20 dead transitions in 74636ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 101/101 places, 2184/2204 transitions.
Applied a total of 0 rules in 253 ms. Remains 101 /101 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-01 05:46:36] [INFO ] Redundant transitions in 52 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 75853 ms. Remains : 101/101 places, 2184/2204 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-00 finished in 223600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-06-01 05:46:37] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:46:37] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:46:37] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 05:46:58] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 55675ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 55709ms
[2024-06-01 05:47:32] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:47:32] [INFO ] Invariant cache hit.
[2024-06-01 05:47:33] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 05:47:33] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:47:33] [INFO ] Invariant cache hit.
[2024-06-01 05:47:33] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:47:34] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1407 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57143 ms. Remains : 104/106 places, 2208/2208 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-01
Product exploration explored 100000 steps with 1237 reset in 789 ms.
Product exploration explored 100000 steps with 1244 reset in 515 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/104 stabilizing places and 84/2208 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 345 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-06-01 05:47:36] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-06-01 05:47:36] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:47:36] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:47:36] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-06-01 05:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:47:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:47:37] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 05:47:37] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:47:38] [INFO ] [Nat]Added 101 Read/Feed constraints in 794 ms returned sat
[2024-06-01 05:47:38] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 162 ms.
[2024-06-01 05:47:38] [INFO ] Added : 26 causal constraints over 6 iterations in 472 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2208/2208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 2207
Applied a total of 2 rules in 237 ms. Remains 103 /104 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:47:38] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 103 cols
[2024-06-01 05:47:38] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:47:38] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:48:00] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55378ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55404ms
[2024-06-01 05:48:34] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:48:34] [INFO ] Invariant cache hit.
[2024-06-01 05:48:34] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 05:48:34] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:48:34] [INFO ] Invariant cache hit.
[2024-06-01 05:48:34] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:48:35] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2024-06-01 05:48:35] [INFO ] Redundant transitions in 42 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:48:35] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:48:35] [INFO ] Invariant cache hit.
[2024-06-01 05:48:35] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:48:57] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/391 variables, 103/109 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 101/210 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 2412 constraints, problems are : Problem set: 2 solved, 2202 unsolved in 34872 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2202/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 80480ms problems are : Problem set: 2 solved, 2202 unsolved
Search for dead transitions found 2 dead transitions in 80501ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/104 places, 2205/2208 transitions.
Applied a total of 0 rules in 171 ms. Remains 103 /103 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 05:49:56] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 137721 ms. Remains : 103/104 places, 2205/2208 transitions.
Computed a total of 46 stabilizing places and 81 stable transitions
Computed a total of 46 stabilizing places and 81 stable transitions
Detected a total of 46/103 stabilizing places and 81/2205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 268 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))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 107 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
[2024-06-01 05:49:56] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 103 cols
[2024-06-01 05:49:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:49:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:57] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-01 05:49:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:49:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:49:58] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 05:49:58] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:49:58] [INFO ] [Nat]Added 101 Read/Feed constraints in 366 ms returned sat
[2024-06-01 05:49:58] [INFO ] Computed and/alt/rep : 88/176/88 causal constraints (skipped 195 transitions) in 272 ms.
[2024-06-01 05:49:59] [INFO ] Added : 24 causal constraints over 6 iterations in 667 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1562 reset in 782 ms.
Product exploration explored 100000 steps with 1547 reset in 609 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2205/2205 transitions.
Applied a total of 0 rules in 163 ms. Remains 103 /103 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 2202 sub problems to find dead transitions.
[2024-06-01 05:50:00] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
[2024-06-01 05:50:00] [INFO ] Invariant cache hit.
[2024-06-01 05:50:00] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2202 unsolved
[2024-06-01 05:50:21] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
[2024-06-01 05:50:23] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1083 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/389 variables, and 7 constraints, problems are : Problem set: 19 solved, 2183 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2202/2202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 2183 unsolved
Problem TDEAD1134 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 2182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/389 variables, and 7 constraints, problems are : Problem set: 20 solved, 2182 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2202 constraints, Known Traps: 2/2 constraints]
After SMT, in 55101ms problems are : Problem set: 20 solved, 2182 unsolved
Search for dead transitions found 20 dead transitions in 55121ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-06-01 05:50:56] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
// Phase 1: matrix 285 rows 103 cols
[2024-06-01 05:50:56] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:50:56] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 05:50:56] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
[2024-06-01 05:50:56] [INFO ] Invariant cache hit.
[2024-06-01 05:50:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:50:58] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
[2024-06-01 05:50:58] [INFO ] Redundant transitions in 86 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 2185/2205 transitions.
Applied a total of 0 rules in 208 ms. Remains 103 /103 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57989 ms. Remains : 103/103 places, 2185/2205 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-01 finished in 261899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 264 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:50:59] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-06-01 05:50:59] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:50:59] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:51:23] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 58272ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58298ms
[2024-06-01 05:51:57] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:51:57] [INFO ] Invariant cache hit.
[2024-06-01 05:51:57] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-01 05:51:57] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:51:57] [INFO ] Invariant cache hit.
[2024-06-01 05:51:57] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:51:58] [INFO ] Implicit Places using invariants and state equation in 915 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1258 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 218 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60046 ms. Remains : 103/106 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-03
Product exploration explored 100000 steps with 685 reset in 912 ms.
Product exploration explored 100000 steps with 685 reset in 625 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2207 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (265 resets) in 446 ms. (89 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 769 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (116 resets) in 560 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 486 ms. (82 steps per ms) remains 3/3 properties
[2024-06-01 05:52:01] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 103 cols
[2024-06-01 05:52:01] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:52:01] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 246/305 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/389 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/391 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 246/305 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/389 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/391 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1160ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1112 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2207/2207 transitions.
Applied a total of 0 rules in 223 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:52:04] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:52:04] [INFO ] Invariant cache hit.
[2024-06-01 05:52:04] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:52:26] [INFO ] Deduced a trap composed of 5 places in 281 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 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56751ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57005 ms. Remains : 103/103 places, 2207/2207 transitions.
RANDOM walk for 40001 steps (264 resets) in 1224 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 679 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (116 resets) in 564 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 563 ms. (70 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 225732 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 225732 steps, saw 60193 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 05:53:04] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:53:04] [INFO ] Invariant cache hit.
[2024-06-01 05:53:05] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 246/305 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/389 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/391 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 246/305 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/389 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/391 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1617ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 689 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2207/2207 transitions.
Applied a total of 0 rules in 162 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 103/103 places, 2207/2207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2207/2207 transitions.
Applied a total of 0 rules in 167 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
[2024-06-01 05:53:07] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:53:07] [INFO ] Invariant cache hit.
[2024-06-01 05:53:07] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 05:53:07] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:53:07] [INFO ] Invariant cache hit.
[2024-06-01 05:53:08] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:53:09] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-06-01 05:53:09] [INFO ] Redundant transitions in 54 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:53:09] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:53:09] [INFO ] Invariant cache hit.
[2024-06-01 05:53:09] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:53:30] [INFO ] Deduced a trap composed of 5 places in 392 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/391 variables, 103/109 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
SMT process timed out in 75463ms, After SMT, problems are : Problem set: 2 solved, 2202 unsolved
Search for dead transitions found 2 dead transitions in 75487ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 2205/2207 transitions.
Applied a total of 0 rules in 153 ms. Remains 103 /103 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 05:54:24] [INFO ] Redundant transitions in 35 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77447 ms. Remains : 103/103 places, 2205/2207 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2207/2207 transitions.
Applied a total of 0 rules in 228 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:54:25] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:54:25] [INFO ] Invariant cache hit.
[2024-06-01 05:54:25] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:54:46] [INFO ] Deduced a trap composed of 5 places in 377 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 54993ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55017ms
[2024-06-01 05:55:20] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:55:20] [INFO ] Invariant cache hit.
[2024-06-01 05:55:20] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 05:55:20] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:55:20] [INFO ] Invariant cache hit.
[2024-06-01 05:55:20] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:55:21] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2024-06-01 05:55:21] [INFO ] Redundant transitions in 54 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:55:22] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:55:22] [INFO ] Invariant cache hit.
[2024-06-01 05:55:22] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:55:43] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/391 variables, 103/109 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
SMT process timed out in 76036ms, After SMT, problems are : Problem set: 2 solved, 2202 unsolved
Search for dead transitions found 2 dead transitions in 76059ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 2205/2207 transitions.
Applied a total of 0 rules in 203 ms. Remains 103 /103 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 05:56:38] [INFO ] Redundant transitions in 53 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 132950 ms. Remains : 103/103 places, 2205/2207 transitions.
Computed a total of 46 stabilizing places and 81 stable transitions
Computed a total of 46 stabilizing places and 81 stable transitions
Detected a total of 46/103 stabilizing places and 81/2205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (265 resets) in 1331 ms. (30 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (132 resets) in 722 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (116 resets) in 542 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 621 ms. (64 steps per ms) remains 3/3 properties
[2024-06-01 05:56:39] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 103 cols
[2024-06-01 05:56:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:56:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 246/305 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/387 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/389 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 246/305 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/387 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/389 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1707ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1525 ms.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2205/2205 transitions.
Applied a total of 0 rules in 162 ms. Remains 103 /103 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 2202 sub problems to find dead transitions.
[2024-06-01 05:56:42] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
[2024-06-01 05:56:42] [INFO ] Invariant cache hit.
[2024-06-01 05:56:43] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2202 unsolved
[2024-06-01 05:57:04] [INFO ] Deduced a trap composed of 51 places in 246 ms of which 1 ms to minimize.
[2024-06-01 05:57:04] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 2 ms to minimize.
[2024-06-01 05:57:06] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 5 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD808 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/389 variables, and 8 constraints, problems are : Problem set: 14 solved, 2188 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2202/2202 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 14 solved, 2188 unsolved
Problem TDEAD859 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1114 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/8 constraints. Problems are: Problem set: 20 solved, 2182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/389 variables, and 8 constraints, problems are : Problem set: 20 solved, 2182 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2202 constraints, Known Traps: 3/3 constraints]
After SMT, in 55757ms problems are : Problem set: 20 solved, 2182 unsolved
Search for dead transitions found 20 dead transitions in 55778ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 2185/2205 transitions.
Applied a total of 0 rules in 172 ms. Remains 103 /103 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56118 ms. Remains : 103/103 places, 2185/2205 transitions.
RANDOM walk for 40000 steps (265 resets) in 1427 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (132 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (116 resets) in 586 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 614 ms. (65 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 287794 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 3
Probabilistic random walk after 287794 steps, saw 75356 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-06-01 05:57:42] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
// Phase 1: matrix 285 rows 103 cols
[2024-06-01 05:57:42] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:57:42] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 245/304 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/386 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 100/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 388/388 variables, and 208 constraints, problems are : Problem set: 3 solved, 0 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1))), (G p0), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 23 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-03 finished in 404377 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((G(p1)||p0)) U X(X(G(!p2)))))'
Support contains 97 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 16 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:57:43] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-06-01 05:57:43] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:57:43] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:58:04] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55523ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55552ms
[2024-06-01 05:58:38] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:58:38] [INFO ] Invariant cache hit.
[2024-06-01 05:58:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 05:58:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:58:39] [INFO ] Invariant cache hit.
[2024-06-01 05:58:39] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:58:39] [INFO ] Implicit Places using invariants and state equation in 365 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 491 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56081 ms. Remains : 103/106 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 304 ms :[p2, (AND (NOT p1) p2), (AND (NOT p1) (NOT p0) p2), p2, true, (AND p2 (NOT p1)), (AND (NOT p1) (NOT p0) p2), p2, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-04
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-04 finished in 56445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:58:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:58:39] [INFO ] Invariant cache hit.
[2024-06-01 05:58:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:59:00] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 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 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 54505ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 54535ms
[2024-06-01 05:59:34] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:59:34] [INFO ] Invariant cache hit.
[2024-06-01 05:59:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 05:59:34] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:59:34] [INFO ] Invariant cache hit.
[2024-06-01 05:59:34] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:59:34] [INFO ] Implicit Places using invariants and state equation in 467 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 597 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55156 ms. Remains : 103/106 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-06
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 16 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-06 finished in 55265 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(p0))||X((F(p1)&&G(p2)))))'
Support contains 47 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 14 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 05:59:35] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 05:59:35] [INFO ] Invariant cache hit.
[2024-06-01 05:59:35] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 05:59:55] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 54604ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 54630ms
[2024-06-01 06:00:29] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:00:29] [INFO ] Invariant cache hit.
[2024-06-01 06:00:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 06:00:29] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:00:29] [INFO ] Invariant cache hit.
[2024-06-01 06:00:29] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:00:30] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:00:30] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:00:30] [INFO ] Invariant cache hit.
[2024-06-01 06:00:30] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:00:52] [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 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 76067ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 76093ms
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2207/2208 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131213 ms. Remains : 105/106 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-07
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-07 finished in 131586 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 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 231 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:01:46] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:01:46] [INFO ] Invariant cache hit.
[2024-06-01 06:01:46] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:02:08] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55682ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55707ms
[2024-06-01 06:02:42] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:02:42] [INFO ] Invariant cache hit.
[2024-06-01 06:02:42] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 06:02:42] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:02:42] [INFO ] Invariant cache hit.
[2024-06-01 06:02:42] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:02:43] [INFO ] Implicit Places using invariants and state equation in 906 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1151 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 256 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57350 ms. Remains : 104/106 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-08
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-08 finished in 57412 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((G(p1)||X(p2)||p0)))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:02:44] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:02:44] [INFO ] Invariant cache hit.
[2024-06-01 06:02:44] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:03:06] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56315ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56339ms
[2024-06-01 06:03:40] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:03:40] [INFO ] Invariant cache hit.
[2024-06-01 06:03:40] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 06:03:40] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:03:40] [INFO ] Invariant cache hit.
[2024-06-01 06:03:40] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:03:41] [INFO ] Implicit Places using invariants and state equation in 703 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 935 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57300 ms. Remains : 104/106 places, 2207/2208 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-09
Product exploration explored 100000 steps with 602 reset in 660 ms.
Product exploration explored 100000 steps with 602 reset in 668 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 103 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (228 resets) in 710 ms. (56 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40001 steps (88 resets) in 822 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (100 resets) in 581 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (88 resets) in 515 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (99 resets) in 648 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (76 resets) in 525 ms. (76 steps per ms) remains 5/5 properties
[2024-06-01 06:03:44] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 104 cols
[2024-06-01 06:03:44] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:03:44] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem apf0 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 210 constraints, problems are : Problem set: 3 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 2/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/392 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 212 constraints, problems are : Problem set: 3 solved, 2 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 194 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:03:45] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:03:45] [INFO ] Invariant cache hit.
[2024-06-01 06:03:45] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:04:07] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55991ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56216 ms. Remains : 104/104 places, 2207/2207 transitions.
RANDOM walk for 40000 steps (228 resets) in 866 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 263663 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 263663 steps, saw 69189 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 06:04:45] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:04:45] [INFO ] Invariant cache hit.
[2024-06-01 06:04:45] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/392 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1056ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 372 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 195 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 104/104 places, 2207/2207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 193 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
[2024-06-01 06:04:46] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:04:46] [INFO ] Invariant cache hit.
[2024-06-01 06:04:47] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-01 06:04:47] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:04:47] [INFO ] Invariant cache hit.
[2024-06-01 06:04:47] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:04:48] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
[2024-06-01 06:04:48] [INFO ] Redundant transitions in 85 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:04:48] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:04:48] [INFO ] Invariant cache hit.
[2024-06-01 06:04:48] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:05: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 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
SMT process timed out in 75176ms, After SMT, problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 75203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77159 ms. Remains : 104/104 places, 2207/2207 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p2 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 274 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 187 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:06:04] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:06:04] [INFO ] Invariant cache hit.
[2024-06-01 06:06:04] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:06:26] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56342ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56362ms
[2024-06-01 06:07:00] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:07:00] [INFO ] Invariant cache hit.
[2024-06-01 06:07:01] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 06:07:01] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:07:01] [INFO ] Invariant cache hit.
[2024-06-01 06:07:01] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:07:02] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2024-06-01 06:07:02] [INFO ] Redundant transitions in 83 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:07:02] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:07:02] [INFO ] Invariant cache hit.
[2024-06-01 06:07:02] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:07:23] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/392 variables, 104/110 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
SMT process timed out in 75475ms, After SMT, problems are : Problem set: 2 solved, 2202 unsolved
Search for dead transitions found 2 dead transitions in 75500ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2205/2207 transitions.
Applied a total of 0 rules in 179 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 06:08:18] [INFO ] Redundant transitions in 40 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 133834 ms. Remains : 104/104 places, 2205/2207 transitions.
Computed a total of 47 stabilizing places and 81 stable transitions
Computed a total of 47 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND p2 p0), (X (AND p2 p0)), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (AND p2 p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (228 resets) in 784 ms. (50 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 366 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
[2024-06-01 06:08:18] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-06-01 06:08:18] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 06:08:18] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/81 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/347 variables, 81/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 50/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 42/389 variables, 22/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 51/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 211 constraints, problems are : Problem set: 1 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 45/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 4/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 212 constraints, problems are : Problem set: 1 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2205/2205 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 2204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 101 transition count 2203
Applied a total of 5 rules in 242 ms. Remains 101 /104 variables (removed 3) and now considering 2203/2205 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 101/104 places, 2203/2205 transitions.
RANDOM walk for 40000 steps (320 resets) in 511 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 278413 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278413 steps, saw 79399 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-01 06:08:23] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
// Phase 1: matrix 284 rows 101 cols
[2024-06-01 06:08:23] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 06:08:23] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/383 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/385 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/383 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/385 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2203/2203 transitions.
Applied a total of 0 rules in 199 ms. Remains 101 /101 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 101/101 places, 2203/2203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2203/2203 transitions.
Applied a total of 0 rules in 199 ms. Remains 101 /101 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
[2024-06-01 06:08:24] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:08:24] [INFO ] Invariant cache hit.
[2024-06-01 06:08:24] [INFO ] Implicit Places using invariants in 376 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 378 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/101 places, 2203/2203 transitions.
Applied a total of 0 rules in 200 ms. Remains 100 /100 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 777 ms. Remains : 100/101 places, 2203/2203 transitions.
RANDOM walk for 40000 steps (318 resets) in 496 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 295073 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 295073 steps, saw 84583 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-06-01 06:08:28] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
// Phase 1: matrix 284 rows 100 cols
[2024-06-01 06:08:28] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 06:08:28] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/382 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 101/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/384 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/382 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 101/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/384 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/384 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 650ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 245 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2203/2203 transitions.
Applied a total of 0 rules in 199 ms. Remains 100 /100 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 100/100 places, 2203/2203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2203/2203 transitions.
Applied a total of 0 rules in 194 ms. Remains 100 /100 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
[2024-06-01 06:08:29] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:08:29] [INFO ] Invariant cache hit.
[2024-06-01 06:08:29] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 06:08:29] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:08:29] [INFO ] Invariant cache hit.
[2024-06-01 06:08:29] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:08:30] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2024-06-01 06:08:30] [INFO ] Redundant transitions in 78 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-06-01 06:08:30] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:08:30] [INFO ] Invariant cache hit.
[2024-06-01 06:08:30] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-06-01 06:08:52] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2024-06-01 06:09:10] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 1 ms to minimize.
Problem TDEAD1183 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1693 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/384 variables, and 6 constraints, problems are : Problem set: 11 solved, 2189 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 2189 unsolved
Problem TDEAD1744 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2152 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/6 constraints. Problems are: Problem set: 20 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/384 variables, and 6 constraints, problems are : Problem set: 20 solved, 2180 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2200 constraints, Known Traps: 2/2 constraints]
After SMT, in 76047ms problems are : Problem set: 20 solved, 2180 unsolved
Search for dead transitions found 20 dead transitions in 76074ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/100 places, 2183/2203 transitions.
Applied a total of 0 rules in 162 ms. Remains 100 /100 variables (removed 0) and now considering 2183/2183 (removed 0) transitions.
[2024-06-01 06:09:47] [INFO ] Redundant transitions in 41 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77871 ms. Remains : 100/100 places, 2183/2203 transitions.
RANDOM walk for 40000 steps (318 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 303394 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 303394 steps, saw 86754 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-06-01 06:09:50] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
// Phase 1: matrix 283 rows 100 cols
[2024-06-01 06:09:50] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 06:09:50] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/299 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/381 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 100/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/383 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/299 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/381 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 100/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/383 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2183/2183 transitions.
Applied a total of 0 rules in 157 ms. Remains 100 /100 variables (removed 0) and now considering 2183/2183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 100/100 places, 2183/2183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2183/2183 transitions.
Applied a total of 0 rules in 161 ms. Remains 100 /100 variables (removed 0) and now considering 2183/2183 (removed 0) transitions.
[2024-06-01 06:09:51] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
[2024-06-01 06:09:51] [INFO ] Invariant cache hit.
[2024-06-01 06:09:51] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 06:09:51] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
[2024-06-01 06:09:51] [INFO ] Invariant cache hit.
[2024-06-01 06:09:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 06:09:54] [INFO ] Implicit Places using invariants and state equation in 2566 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
[2024-06-01 06:09:54] [INFO ] Redundant transitions in 66 ms returned []
Running 2180 sub problems to find dead transitions.
[2024-06-01 06:09:54] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
[2024-06-01 06:09:54] [INFO ] Invariant cache hit.
[2024-06-01 06:09:54] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
[2024-06-01 06:10:14] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/383 variables, and 5 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2180/2180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/383 variables, and 5 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/2180 constraints, Known Traps: 1/1 constraints]
After SMT, in 74918ms problems are : Problem set: 0 solved, 2180 unsolved
Search for dead transitions found 0 dead transitions in 74942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78084 ms. Remains : 100/100 places, 2183/2183 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0), (X (AND p2 p0)), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (AND p2 p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 12 factoid took 296 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 602 reset in 787 ms.
Product exploration explored 100000 steps with 602 reset in 586 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2205/2205 transitions.
Applied a total of 0 rules in 163 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 2202 sub problems to find dead transitions.
[2024-06-01 06:11:11] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-06-01 06:11:11] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 06:11:11] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2202 unsolved
[2024-06-01 06:11:32] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 1 ms to minimize.
[2024-06-01 06:11:34] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD777 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/390 variables, and 8 constraints, problems are : Problem set: 13 solved, 2189 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2202/2202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 13 solved, 2189 unsolved
Problem TDEAD828 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1134 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/8 constraints. Problems are: Problem set: 20 solved, 2182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/390 variables, and 8 constraints, problems are : Problem set: 20 solved, 2182 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2202 constraints, Known Traps: 2/2 constraints]
After SMT, in 54700ms problems are : Problem set: 20 solved, 2182 unsolved
Search for dead transitions found 20 dead transitions in 54721ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-06-01 06:12:06] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
// Phase 1: matrix 285 rows 104 cols
[2024-06-01 06:12:06] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 06:12:06] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 06:12:06] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
[2024-06-01 06:12:06] [INFO ] Invariant cache hit.
[2024-06-01 06:12:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 06:12:08] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2024-06-01 06:12:08] [INFO ] Redundant transitions in 53 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2185/2205 transitions.
Applied a total of 0 rules in 207 ms. Remains 104 /104 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57154 ms. Remains : 104/104 places, 2185/2205 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-09 finished in 564507 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)&&G((F(p0) U (G(!p2)&&p1)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 205 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-06-01 06:12:08] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 06:12:08] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 06:12:08] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 06:12:31] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 56369ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 56406ms
[2024-06-01 06:13:05] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 06:13:05] [INFO ] Invariant cache hit.
[2024-06-01 06:13:05] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 06:13:05] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 06:13:05] [INFO ] Invariant cache hit.
[2024-06-01 06:13:05] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:13:07] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1918 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 284 ms. Remains 104 /104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58834 ms. Remains : 104/106 places, 2208/2208 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), (OR (NOT p1) p2), p2]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-12
Stuttering criterion allowed to conclude after 273 steps with 1 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-12 finished in 59170 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 (p1||G(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-01
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 46 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:13:08] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-06-01 06:13:08] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 06:13:08] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:13:29] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55253ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55279ms
[2024-06-01 06:14:03] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:14:03] [INFO ] Invariant cache hit.
[2024-06-01 06:14:03] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 06:14:03] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:14:03] [INFO ] Invariant cache hit.
[2024-06-01 06:14:03] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:14:05] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1983 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 45 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 57360 ms. Remains : 103/106 places, 2207/2208 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-01
Product exploration explored 100000 steps with 1547 reset in 632 ms.
Product exploration explored 100000 steps with 1519 reset in 644 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2207 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 271 steps (0 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 84 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:14:07] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 103 cols
[2024-06-01 06:14:07] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:14:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:14:07] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 06:14:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:14:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:14:08] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 06:14:08] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:14:08] [INFO ] [Nat]Added 101 Read/Feed constraints in 527 ms returned sat
[2024-06-01 06:14:09] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 82 ms.
[2024-06-01 06:14:09] [INFO ] Added : 22 causal constraints over 6 iterations in 665 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2207/2207 transitions.
Applied a total of 0 rules in 230 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:14:09] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:14:09] [INFO ] Invariant cache hit.
[2024-06-01 06:14:09] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:14:32] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56278ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56301ms
[2024-06-01 06:15:06] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:15:06] [INFO ] Invariant cache hit.
[2024-06-01 06:15:06] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-06-01 06:15:06] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:15:06] [INFO ] Invariant cache hit.
[2024-06-01 06:15:06] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:15:07] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2024-06-01 06:15:07] [INFO ] Redundant transitions in 86 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:15:07] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:15:07] [INFO ] Invariant cache hit.
[2024-06-01 06:15:07] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:15:29] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 75198ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 75224ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133090 ms. Remains : 103/103 places, 2207/2207 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2207 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 68 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 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 340 steps (0 resets) in 7 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 79 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 42 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:16:23] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:16:23] [INFO ] Invariant cache hit.
[2024-06-01 06:16:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 06:16:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 06:16:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:16:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:16:24] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 06:16:24] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:16:24] [INFO ] [Nat]Added 101 Read/Feed constraints in 310 ms returned sat
[2024-06-01 06:16:24] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 69 ms.
[2024-06-01 06:16:24] [INFO ] Added : 22 causal constraints over 5 iterations in 214 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1516 reset in 557 ms.
Product exploration explored 100000 steps with 1525 reset in 565 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2207/2207 transitions.
Applied a total of 0 rules in 151 ms. Remains 103 /103 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:16:26] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:16:26] [INFO ] Invariant cache hit.
[2024-06-01 06:16:26] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:16:46] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55409ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55427ms
[2024-06-01 06:17:21] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:17:21] [INFO ] Invariant cache hit.
[2024-06-01 06:17:21] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-01 06:17:21] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:17:21] [INFO ] Invariant cache hit.
[2024-06-01 06:17:21] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:17:22] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2024-06-01 06:17:22] [INFO ] Redundant transitions in 77 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:17:22] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:17:22] [INFO ] Invariant cache hit.
[2024-06-01 06:17:22] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:17:44] [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 103/391 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/103 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
SMT process timed out in 76033ms, After SMT, problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 76058ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 132811 ms. Remains : 103/103 places, 2207/2207 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-01 finished in 330963 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((G(p1)||X(p2)||p0)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-09
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 22 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:18:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-06-01 06:18:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:18:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:19:01] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55695ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55715ms
[2024-06-01 06:19:34] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:19:34] [INFO ] Invariant cache hit.
[2024-06-01 06:19:35] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 06:19:35] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:19:35] [INFO ] Invariant cache hit.
[2024-06-01 06:19:35] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:19:35] [INFO ] Implicit Places using invariants and state equation in 709 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1055 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 104/106 places, 2207/2208 transitions.
Applied a total of 0 rules in 20 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 56817 ms. Remains : 104/106 places, 2207/2208 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-09
Product exploration explored 100000 steps with 602 reset in 758 ms.
Product exploration explored 100000 steps with 602 reset in 593 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 138 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (228 resets) in 767 ms. (52 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (88 resets) in 799 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (100 resets) in 907 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (88 resets) in 892 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (100 resets) in 866 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 776 ms. (51 steps per ms) remains 5/5 properties
[2024-06-01 06:19:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 104 cols
[2024-06-01 06:19:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:19:39] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem apf0 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 210 constraints, problems are : Problem set: 3 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 2/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/392 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 212 constraints, problems are : Problem set: 3 solved, 2 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 199 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:19:40] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:19:40] [INFO ] Invariant cache hit.
[2024-06-01 06:19:40] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:20:01] [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 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55536ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55762 ms. Remains : 104/104 places, 2207/2207 transitions.
RANDOM walk for 40001 steps (228 resets) in 866 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 248430 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 248430 steps, saw 64838 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 06:20:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:20:39] [INFO ] Invariant cache hit.
[2024-06-01 06:20:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 267/348 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 50/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 43/391 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 51/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/392 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 319 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 230 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 104/104 places, 2207/2207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 194 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
[2024-06-01 06:20:41] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:20:41] [INFO ] Invariant cache hit.
[2024-06-01 06:20:41] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 06:20:41] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:20:41] [INFO ] Invariant cache hit.
[2024-06-01 06:20:41] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:20:42] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2024-06-01 06:20:43] [INFO ] Redundant transitions in 86 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:20:43] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:20:43] [INFO ] Invariant cache hit.
[2024-06-01 06:20:43] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:21:04] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 1.0)
(s22 1.0)
(s23 0.0)
(s24 20.0)
(s25 0.0)
(s26 0.0)
(s27 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/392 variables, 104/110 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
SMT process timed out in 75498ms, After SMT, problems are : Problem set: 2 solved, 2202 unsolved
Search for dead transitions found 2 dead transitions in 75523ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 2205/2207 transitions.
Applied a total of 0 rules in 238 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 06:21:58] [INFO ] Redundant transitions in 89 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77815 ms. Remains : 104/104 places, 2205/2207 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p2 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 371 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 234 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:21:59] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:21:59] [INFO ] Invariant cache hit.
[2024-06-01 06:21:59] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:22:20] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55090ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55113ms
[2024-06-01 06:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:22:54] [INFO ] Invariant cache hit.
[2024-06-01 06:22:55] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-01 06:22:55] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:22:55] [INFO ] Invariant cache hit.
[2024-06-01 06:22:55] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:22:56] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2024-06-01 06:22:56] [INFO ] Redundant transitions in 78 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-06-01 06:22:56] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-06-01 06:22:56] [INFO ] Invariant cache hit.
[2024-06-01 06:22:56] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-06-01 06:23:18] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 288/392 variables, 104/110 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 101/211 constraints. Problems are: Problem set: 2 solved, 2202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 2413 constraints, problems are : Problem set: 2 solved, 2202 unsolved in 34795 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2202/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 80333ms problems are : Problem set: 2 solved, 2202 unsolved
Search for dead transitions found 2 dead transitions in 80357ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2205/2207 transitions.
Applied a total of 0 rules in 180 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 06:24:17] [INFO ] Redundant transitions in 41 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 137747 ms. Remains : 104/104 places, 2205/2207 transitions.
Computed a total of 47 stabilizing places and 81 stable transitions
Computed a total of 47 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND p2 p0), (X (AND p2 p0)), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (AND p2 p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 146 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40001 steps (228 resets) in 824 ms. (48 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
[2024-06-01 06:24:17] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-06-01 06:24:17] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 06:24:17] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/81 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/347 variables, 81/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 50/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 42/389 variables, 22/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 51/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 211 constraints, problems are : Problem set: 1 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 45/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 4/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 212 constraints, problems are : Problem set: 1 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2205/2205 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 2204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 101 transition count 2203
Applied a total of 5 rules in 224 ms. Remains 101 /104 variables (removed 3) and now considering 2203/2205 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 101/104 places, 2203/2205 transitions.
RANDOM walk for 40000 steps (318 resets) in 534 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298187 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298187 steps, saw 85406 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 06:24:22] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
// Phase 1: matrix 284 rows 101 cols
[2024-06-01 06:24:22] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 06:24:22] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/383 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/385 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/383 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/385 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2203/2203 transitions.
Applied a total of 0 rules in 204 ms. Remains 101 /101 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 101/101 places, 2203/2203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2203/2203 transitions.
Applied a total of 0 rules in 197 ms. Remains 101 /101 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
[2024-06-01 06:24:23] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:24:23] [INFO ] Invariant cache hit.
[2024-06-01 06:24:23] [INFO ] Implicit Places using invariants in 342 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 344 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/101 places, 2203/2203 transitions.
Applied a total of 0 rules in 178 ms. Remains 100 /100 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 720 ms. Remains : 100/101 places, 2203/2203 transitions.
RANDOM walk for 40000 steps (320 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 322684 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 322684 steps, saw 91706 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 06:24:27] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
// Phase 1: matrix 284 rows 100 cols
[2024-06-01 06:24:27] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 06:24:27] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/382 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 101/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/384 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/300 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/382 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 101/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/384 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/384 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 252 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2203/2203 transitions.
Applied a total of 0 rules in 215 ms. Remains 100 /100 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 100/100 places, 2203/2203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2203/2203 transitions.
Applied a total of 0 rules in 200 ms. Remains 100 /100 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
[2024-06-01 06:24:28] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:24:28] [INFO ] Invariant cache hit.
[2024-06-01 06:24:28] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 06:24:28] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:24:28] [INFO ] Invariant cache hit.
[2024-06-01 06:24:28] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 06:24:30] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2024-06-01 06:24:30] [INFO ] Redundant transitions in 58 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-06-01 06:24:30] [INFO ] Flow matrix only has 284 transitions (discarded 1919 similar events)
[2024-06-01 06:24:30] [INFO ] Invariant cache hit.
[2024-06-01 06:24:30] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-06-01 06:24:51] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2024-06-01 06:25:05] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 1 ms to minimize.
Problem TDEAD1183 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1846 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/384 variables, and 6 constraints, problems are : Problem set: 14 solved, 2186 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 14 solved, 2186 unsolved
Problem TDEAD1897 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2152 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/6 constraints. Problems are: Problem set: 20 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/384 variables, and 6 constraints, problems are : Problem set: 20 solved, 2180 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2200 constraints, Known Traps: 2/2 constraints]
After SMT, in 75629ms problems are : Problem set: 20 solved, 2180 unsolved
Search for dead transitions found 20 dead transitions in 75652ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/100 places, 2183/2203 transitions.
Applied a total of 0 rules in 194 ms. Remains 100 /100 variables (removed 0) and now considering 2183/2183 (removed 0) transitions.
[2024-06-01 06:25:46] [INFO ] Redundant transitions in 53 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77779 ms. Remains : 100/100 places, 2183/2203 transitions.
RANDOM walk for 40000 steps (317 resets) in 500 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 288388 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 288388 steps, saw 82270 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 06:25:49] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
// Phase 1: matrix 283 rows 100 cols
[2024-06-01 06:25:49] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 06:25:49] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/299 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/381 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 100/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/383 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/299 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/381 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 100/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/383 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2183/2183 transitions.
Applied a total of 0 rules in 199 ms. Remains 100 /100 variables (removed 0) and now considering 2183/2183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 100/100 places, 2183/2183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2183/2183 transitions.
Applied a total of 0 rules in 194 ms. Remains 100 /100 variables (removed 0) and now considering 2183/2183 (removed 0) transitions.
[2024-06-01 06:25:50] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
[2024-06-01 06:25:50] [INFO ] Invariant cache hit.
[2024-06-01 06:25:50] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 06:25:50] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
[2024-06-01 06:25:50] [INFO ] Invariant cache hit.
[2024-06-01 06:25:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 06:25:53] [INFO ] Implicit Places using invariants and state equation in 2602 ms returned []
Implicit Place search using SMT with State Equation took 2903 ms to find 0 implicit places.
[2024-06-01 06:25:53] [INFO ] Redundant transitions in 59 ms returned []
Running 2180 sub problems to find dead transitions.
[2024-06-01 06:25:53] [INFO ] Flow matrix only has 283 transitions (discarded 1900 similar events)
[2024-06-01 06:25:53] [INFO ] Invariant cache hit.
[2024-06-01 06:25:53] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/383 variables, and 5 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2180/2180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
At refinement iteration 3 (OVERLAPS) 283/383 variables, 100/105 constraints. Problems are: Problem set: 438 solved, 1742 unsolved
SMT process timed out in 74728ms, After SMT, problems are : Problem set: 438 solved, 1742 unsolved
Search for dead transitions found 438 dead transitions in 74751ms
Found 438 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 438 transitions
Dead transitions reduction (with SMT) removed 438 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/100 places, 1745/2183 transitions.
Reduce places removed 9 places and 158 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 91 transition count 1587
Applied a total of 9 rules in 114 ms. Remains 91 /100 variables (removed 9) and now considering 1587/1745 (removed 158) transitions.
[2024-06-01 06:27:08] [INFO ] Flow matrix only has 244 transitions (discarded 1343 similar events)
// Phase 1: matrix 244 rows 91 cols
[2024-06-01 06:27:08] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 06:27:08] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-06-01 06:27:08] [INFO ] Flow matrix only has 244 transitions (discarded 1343 similar events)
[2024-06-01 06:27:08] [INFO ] Invariant cache hit.
[2024-06-01 06:27:08] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-01 06:27:09] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/100 places, 1587/2183 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79219 ms. Remains : 91/100 places, 1587/2183 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0), (X (AND p2 p0)), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (AND p2 p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 12 factoid took 249 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 602 reset in 654 ms.
Product exploration explored 100000 steps with 602 reset in 641 ms.
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2205/2205 transitions.
Applied a total of 0 rules in 179 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 2202 sub problems to find dead transitions.
[2024-06-01 06:27:11] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-06-01 06:27:11] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 06:27:11] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2202 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD726 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/390 variables, and 8 constraints, problems are : Problem set: 12 solved, 2190 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2202/2202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 2190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 12 solved, 2190 unsolved
Problem TDEAD777 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1134 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/8 constraints. Problems are: Problem set: 20 solved, 2182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/390 variables, and 8 constraints, problems are : Problem set: 20 solved, 2182 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2202 constraints, Known Traps: 2/2 constraints]
After SMT, in 55811ms problems are : Problem set: 20 solved, 2182 unsolved
Search for dead transitions found 20 dead transitions in 55832ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-06-01 06:28:07] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
// Phase 1: matrix 285 rows 104 cols
[2024-06-01 06:28:07] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 06:28:07] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 06:28:07] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
[2024-06-01 06:28:07] [INFO ] Invariant cache hit.
[2024-06-01 06:28:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 06:28:09] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-06-01 06:28:09] [INFO ] Redundant transitions in 82 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2185/2205 transitions.
Applied a total of 0 rules in 227 ms. Remains 104 /104 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58345 ms. Remains : 104/104 places, 2185/2205 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-09 finished in 570725 ms.
[2024-06-01 06:28:09] [INFO ] Flatten gal took : 115 ms
[2024-06-01 06:28:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 18 ms.
[2024-06-01 06:28:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 2208 transitions and 17028 arcs took 23 ms.
Total runtime 2876817 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N50-LTLFireability-00
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223440793

--------------------
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-PT-V20P20N50-LTLFireability-00
ltl formula formula --ltl=/tmp/2438/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 106 places, 2208 transitions and 17028 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.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2438/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2438/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2438/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2438/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N50-LTLFireability-01
ltl formula formula --ltl=/tmp/2438/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 106 places, 2208 transitions and 17028 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.170 real 0.060 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2438/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2438/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2438/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2438/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 2210 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~103 levels ~10000 states ~22692 transitions
pnml2lts-mc( 1/ 4): ~103 levels ~20000 states ~47968 transitions
pnml2lts-mc( 1/ 4): ~103 levels ~40000 states ~108360 transitions
pnml2lts-mc( 1/ 4): ~103 levels ~80000 states ~230968 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 123662
pnml2lts-mc( 0/ 4): unique states count: 123662
pnml2lts-mc( 0/ 4): unique transitions count: 400638
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 286297
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 129417
pnml2lts-mc( 0/ 4): - cum. max stack depth: 408
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 129417 states 419908 transitions, fanout: 3.245
pnml2lts-mc( 0/ 4): Total exploration time 2.030 sec (2.030 sec minimum, 2.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 63752, Transitions per second: 206851
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.7MB, 14.7 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 2265 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.7MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P20N50-LTLFireability-09
ltl formula formula --ltl=/tmp/2438/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 106 places, 2208 transitions and 17028 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.240 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2438/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2438/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2438/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2438/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 109 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 2225 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( 3/ 4): ~164 levels ~10000 states ~44664 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~20000 states ~82300 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~40000 states ~172144 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~80000 states ~353608 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~160000 states ~716416 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~320000 states ~1778872 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~640000 states ~3651508 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~1280000 states ~8039160 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~2560000 states ~16454972 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~5120000 states ~32074576 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9803184
pnml2lts-mc( 0/ 4): unique states count: 9803184
pnml2lts-mc( 0/ 4): unique transitions count: 64776783
pnml2lts-mc( 0/ 4): - self-loop count: 100
pnml2lts-mc( 0/ 4): - claim dead count: 55920490
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10076367
pnml2lts-mc( 0/ 4): - cum. max stack depth: 681
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10076367 states 66643410 transitions, fanout: 6.614
pnml2lts-mc( 0/ 4): Total exploration time 132.450 sec (132.450 sec minimum, 132.450 sec on average)
pnml2lts-mc( 0/ 4): States per second: 76077, Transitions per second: 503159
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 85.3MB, 9.1 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/16.0%
pnml2lts-mc( 0/ 4): Stored 2265 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 85.3MB (~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-PT-V20P20N50"
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-PT-V20P20N50, 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-171620399000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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