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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 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 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 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.7M 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-V80P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717221740644

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-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:02:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:02:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:02:22] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-01 06:02:22] [INFO ] Transformed 188 places.
[2024-06-01 06:02:22] [INFO ] Transformed 2108 transitions.
[2024-06-01 06:02:22] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 39 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 06:02:22] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:02:22] [INFO ] Computed 5 invariants in 17 ms
[2024-06-01 06:02:22] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:02:47] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20138 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:03:15] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1192 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 5 solved, 2100 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 53502ms problems are : Problem set: 5 solved, 2100 unsolved
Search for dead transitions found 5 dead transitions in 53551ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
[2024-06-01 06:03:16] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:03:16] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 06:03:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 06:03:16] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:03:16] [INFO ] Invariant cache hit.
[2024-06-01 06:03:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:03:16] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2103/2108 transitions.
Applied a total of 0 rules in 21 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53909 ms. Remains : 186/188 places, 2103/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2024-06-01 06:03:17] [INFO ] Flatten gal took : 251 ms
[2024-06-01 06:03:17] [INFO ] Flatten gal took : 163 ms
[2024-06-01 06:03:18] [INFO ] Input system was already deterministic with 2103 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40001 steps (56 resets) in 3712 ms. (10 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40002 steps (20 resets) in 211 ms. (188 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (21 resets) in 207 ms. (192 steps per ms) remains 2/3 properties
[2024-06-01 06:03:19] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:03:19] [INFO ] Invariant cache hit.
[2024-06-01 06:03:19] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/547 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 22/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/556 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1772 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 368/547 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 22/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/556 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2677ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 479 ms.
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2099
Applied a total of 9 rules in 493 ms. Remains 181 /186 variables (removed 5) and now considering 2099/2103 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 181/186 places, 2099/2103 transitions.
RANDOM walk for 40000 steps (80 resets) in 601 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 229666 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :1 out of 2
Probabilistic random walk after 229666 steps, saw 78314 distinct states, run finished after 3007 ms. (steps per millisecond=76 ) properties seen :1
[2024-06-01 06:03:26] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
// Phase 1: matrix 366 rows 181 cols
[2024-06-01 06:03:26] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:03:26] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/547 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2099/2099 transitions.
Applied a total of 0 rules in 202 ms. Remains 181 /181 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 181/181 places, 2099/2099 transitions.
RANDOM walk for 40000 steps (80 resets) in 548 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (39 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 261627 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 261627 steps, saw 88390 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 06:03:31] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:03:31] [INFO ] Invariant cache hit.
[2024-06-01 06:03:31] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/547 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 851ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2099/2099 transitions.
Applied a total of 0 rules in 165 ms. Remains 181 /181 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 181/181 places, 2099/2099 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2099/2099 transitions.
Applied a total of 0 rules in 158 ms. Remains 181 /181 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2024-06-01 06:03:32] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:03:32] [INFO ] Invariant cache hit.
[2024-06-01 06:03:33] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 06:03:33] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:03:33] [INFO ] Invariant cache hit.
[2024-06-01 06:03:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:03:34] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1408 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/181 places, 2099/2099 transitions.
Applied a total of 0 rules in 159 ms. Remains 179 /179 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1726 ms. Remains : 179/181 places, 2099/2099 transitions.
RANDOM walk for 40000 steps (80 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (40 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297449 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297449 steps, saw 95435 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 06:03:37] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
// Phase 1: matrix 366 rows 179 cols
[2024-06-01 06:03:37] [INFO ] Computed 4 invariants in 12 ms
[2024-06-01 06:03:37] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/545 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/545 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/545 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1539ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2099/2099 transitions.
Applied a total of 0 rules in 159 ms. Remains 179 /179 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 179/179 places, 2099/2099 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2099/2099 transitions.
Applied a total of 0 rules in 158 ms. Remains 179 /179 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2024-06-01 06:03:39] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:03:39] [INFO ] Invariant cache hit.
[2024-06-01 06:03:39] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 06:03:39] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:03:39] [INFO ] Invariant cache hit.
[2024-06-01 06:03:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:03:40] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-06-01 06:03:40] [INFO ] Redundant transitions in 152 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 06:03:41] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:03:41] [INFO ] Invariant cache hit.
[2024-06-01 06:03:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 06:04:09] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 2 ms to minimize.
Problem TDEAD393 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/545 variables, and 5 constraints, problems are : Problem set: 75 solved, 2021 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 75 solved, 2021 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 75 solved, 2021 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 75 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/545 variables, and 5 constraints, problems are : Problem set: 75 solved, 2021 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 1/1 constraints]
After SMT, in 73397ms problems are : Problem set: 75 solved, 2021 unsolved
Search for dead transitions found 75 dead transitions in 73436ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/179 places, 2024/2099 transitions.
Applied a total of 0 rules in 118 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-06-01 06:04:54] [INFO ] Redundant transitions in 124 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75341 ms. Remains : 179/179 places, 2024/2099 transitions.
RANDOM walk for 40000 steps (80 resets) in 452 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (39 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 317575 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 317575 steps, saw 101621 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-06-01 06:04:57] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-06-01 06:04:57] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 06:04:57] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/544 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1309ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 117 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 179/179 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 118 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-06-01 06:04:59] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 06:04:59] [INFO ] Invariant cache hit.
[2024-06-01 06:04:59] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 06:04:59] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 06:04:59] [INFO ] Invariant cache hit.
[2024-06-01 06:05:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:05:00] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2024-06-01 06:05:00] [INFO ] Redundant transitions in 49 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-06-01 06:05:00] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-06-01 06:05:00] [INFO ] Invariant cache hit.
[2024-06-01 06:05:00] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/544 variables, and 4 constraints, problems are : Problem set: 0 solved, 2021 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2021/2021 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2021 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2021 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 2 (OVERLAPS) 365/544 variables, 179/183 constraints. Problems are: Problem set: 2 solved, 2019 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 21/204 constraints. Problems are: Problem set: 2 solved, 2019 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 2223 constraints, problems are : Problem set: 2 solved, 2019 unsolved in 33739 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2019/2021 constraints, Known Traps: 0/0 constraints]
After SMT, in 75213ms problems are : Problem set: 2 solved, 2019 unsolved
Search for dead transitions found 2 dead transitions in 75231ms
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 : 179/179 places, 2022/2024 transitions.
Applied a total of 0 rules in 117 ms. Remains 179 /179 variables (removed 0) and now considering 2022/2022 (removed 0) transitions.
[2024-06-01 06:06:16] [INFO ] Redundant transitions in 31 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76763 ms. Remains : 179/179 places, 2022/2024 transitions.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 169 stabilizing places and 324 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 85 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2101
Applied a total of 5 rules in 359 ms. Remains 183 /186 variables (removed 3) and now considering 2101/2103 (removed 2) transitions.
[2024-06-01 06:06:17] [INFO ] Flow matrix only has 368 transitions (discarded 1733 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 06:06:17] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:06:17] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 06:06:17] [INFO ] Flow matrix only has 368 transitions (discarded 1733 similar events)
[2024-06-01 06:06:17] [INFO ] Invariant cache hit.
[2024-06-01 06:06:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:06:18] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1390 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/186 places, 2101/2103 transitions.
Applied a total of 0 rules in 180 ms. Remains 181 /181 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1931 ms. Remains : 181/186 places, 2101/2103 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
Product exploration explored 100000 steps with 1503 reset in 949 ms.
Product exploration explored 100000 steps with 1504 reset in 755 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 160 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 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 934 steps (0 resets) in 28 ms. (32 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 283 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 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2101/2101 transitions.
Applied a total of 0 rules in 146 ms. Remains 181 /181 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
[2024-06-01 06:06:21] [INFO ] Flow matrix only has 368 transitions (discarded 1733 similar events)
// Phase 1: matrix 368 rows 181 cols
[2024-06-01 06:06:21] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 06:06:21] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 06:06:21] [INFO ] Flow matrix only has 368 transitions (discarded 1733 similar events)
[2024-06-01 06:06:21] [INFO ] Invariant cache hit.
[2024-06-01 06:06:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:06:23] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-06-01 06:06:23] [INFO ] Redundant transitions in 75 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-06-01 06:06:23] [INFO ] Flow matrix only has 368 transitions (discarded 1733 similar events)
[2024-06-01 06:06:23] [INFO ] Invariant cache hit.
[2024-06-01 06:06:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 06:06:45] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-06-01 06:07:01] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
Problem TDEAD1116 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1534 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/549 variables, and 6 constraints, problems are : Problem set: 39 solved, 2059 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 39 solved, 2059 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 39 solved, 2059 unsolved
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1930 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/6 constraints. Problems are: Problem set: 75 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/549 variables, and 6 constraints, problems are : Problem set: 75 solved, 2023 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 2/2 constraints]
After SMT, in 72858ms problems are : Problem set: 75 solved, 2023 unsolved
Search for dead transitions found 75 dead transitions in 72883ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/181 places, 2026/2101 transitions.
Applied a total of 0 rules in 136 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-06-01 06:07:37] [INFO ] Redundant transitions in 76 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 75684 ms. Remains : 181/181 places, 2026/2101 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/181 stabilizing places and 322/2026 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 169 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 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 970 steps (0 resets) in 22 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 292 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 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1505 reset in 716 ms.
Product exploration explored 100000 steps with 1496 reset in 743 ms.
Support contains 85 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2026/2026 transitions.
Applied a total of 0 rules in 128 ms. Remains 181 /181 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-06-01 06:07:39] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
// Phase 1: matrix 367 rows 181 cols
[2024-06-01 06:07:39] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:07:39] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 06:07:39] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:07:39] [INFO ] Invariant cache hit.
[2024-06-01 06:07:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:07:41] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
[2024-06-01 06:07:41] [INFO ] Redundant transitions in 70 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-06-01 06:07:41] [INFO ] Flow matrix only has 367 transitions (discarded 1659 similar events)
[2024-06-01 06:07:41] [INFO ] Invariant cache hit.
[2024-06-01 06:07:41] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
[2024-06-01 06:08:01] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/548 variables, and 5 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/181 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 3 (OVERLAPS) 367/548 variables, 181/186 constraints. Problems are: Problem set: 2 solved, 2021 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 21/207 constraints. Problems are: Problem set: 2 solved, 2021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 2228 constraints, problems are : Problem set: 2 solved, 2021 unsolved in 33499 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2021/2023 constraints, Known Traps: 1/1 constraints]
After SMT, in 75444ms problems are : Problem set: 2 solved, 2021 unsolved
Search for dead transitions found 2 dead transitions in 75469ms
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 : 181/181 places, 2024/2026 transitions.
Applied a total of 0 rules in 123 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-06-01 06:08:56] [INFO ] Redundant transitions in 31 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 77696 ms. Remains : 181/181 places, 2024/2026 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-00 finished in 160412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 82 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Applied a total of 2 rules in 17 ms. Remains 185 /186 variables (removed 1) and now considering 2102/2103 (removed 1) transitions.
Running 2099 sub problems to find dead transitions.
[2024-06-01 06:08:57] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:08:57] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 06:08:57] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:09:19] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2099/2099 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:09:48] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
Problem TDEAD1197 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1373 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 7 constraints, problems are : Problem set: 17 solved, 2082 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2099 constraints, Known Traps: 2/2 constraints]
After SMT, in 53295ms problems are : Problem set: 17 solved, 2082 unsolved
Search for dead transitions found 17 dead transitions in 53315ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-06-01 06:09:50] [INFO ] Flow matrix only has 369 transitions (discarded 1716 similar events)
[2024-06-01 06:09:50] [INFO ] Invariant cache hit.
[2024-06-01 06:09:50] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 06:09:50] [INFO ] Flow matrix only has 369 transitions (discarded 1716 similar events)
[2024-06-01 06:09:50] [INFO ] Invariant cache hit.
[2024-06-01 06:09:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:09:51] [INFO ] Implicit Places using invariants and state equation in 879 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1136 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2085/2103 transitions.
Applied a total of 0 rules in 11 ms. Remains 183 /183 variables (removed 0) and now considering 2085/2085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54485 ms. Remains : 183/186 places, 2085/2103 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 258 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-02 finished in 54623 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 (F(p0)&&X(((p1&&F(!p2)) U p2)))))'
Support contains 97 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Applied a total of 2 rules in 22 ms. Remains 185 /186 variables (removed 1) and now considering 2102/2103 (removed 1) transitions.
Running 2099 sub problems to find dead transitions.
[2024-06-01 06:09:51] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:09:51] [INFO ] Invariant cache hit.
[2024-06-01 06:09:51] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:10:15] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2099/2099 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2099 constraints, Known Traps: 1/1 constraints]
After SMT, in 53907ms problems are : Problem set: 0 solved, 2099 unsolved
Search for dead transitions found 0 dead transitions in 53930ms
[2024-06-01 06:10:45] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:10:45] [INFO ] Invariant cache hit.
[2024-06-01 06:10:45] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 06:10:45] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:10:45] [INFO ] Invariant cache hit.
[2024-06-01 06:10:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:10:46] [INFO ] Implicit Places using invariants and state equation in 729 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 852 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2102/2103 transitions.
Applied a total of 0 rules in 9 ms. Remains 183 /183 variables (removed 0) and now considering 2102/2102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54818 ms. Remains : 183/186 places, 2102/2103 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-05
Stuttering criterion allowed to conclude after 704 steps with 10 reset in 24 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-05 finished in 55065 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 p1)||X(F((p0&&X(p0))))))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:10:46] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:10:46] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:10:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:11:10] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 53961ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 53981ms
[2024-06-01 06:11:40] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:11:40] [INFO ] Invariant cache hit.
[2024-06-01 06:11:41] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 06:11:41] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:11:41] [INFO ] Invariant cache hit.
[2024-06-01 06:11:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:11:42] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1490 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55502 ms. Remains : 184/186 places, 2103/2103 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-06
Stuttering criterion allowed to conclude after 4634 steps with 46 reset in 35 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-06 finished in 55715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 94 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:11:42] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:11:42] [INFO ] Invariant cache hit.
[2024-06-01 06:11:42] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:12:34] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 10 solved, 2090 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 53102ms problems are : Problem set: 10 solved, 2090 unsolved
Search for dead transitions found 10 dead transitions in 53127ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2024-06-01 06:12:35] [INFO ] Flow matrix only has 370 transitions (discarded 1723 similar events)
[2024-06-01 06:12:35] [INFO ] Invariant cache hit.
[2024-06-01 06:12:36] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 06:12:36] [INFO ] Flow matrix only has 370 transitions (discarded 1723 similar events)
[2024-06-01 06:12:36] [INFO ] Invariant cache hit.
[2024-06-01 06:12:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:12:37] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1336 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2093/2103 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54490 ms. Remains : 184/186 places, 2093/2103 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 20271 steps with 30 reset in 1679 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-07 finished in 56346 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)))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2099
Applied a total of 9 rules in 293 ms. Remains 181 /186 variables (removed 5) and now considering 2099/2103 (removed 4) transitions.
[2024-06-01 06:12:39] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
// Phase 1: matrix 366 rows 181 cols
[2024-06-01 06:12:39] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:12:39] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 06:12:39] [INFO ] Flow matrix only has 366 transitions (discarded 1733 similar events)
[2024-06-01 06:12:39] [INFO ] Invariant cache hit.
[2024-06-01 06:12:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:12:40] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1380 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2099/2103 transitions.
Applied a total of 0 rules in 213 ms. Remains 179 /179 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1887 ms. Remains : 179/186 places, 2099/2103 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-08
Stuttering criterion allowed to conclude after 497 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-08 finished in 2025 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)&&(p1 U p2))))))'
Support contains 1 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 2102
Applied a total of 2 rules in 222 ms. Remains 185 /186 variables (removed 1) and now considering 2102/2103 (removed 1) transitions.
Running 2099 sub problems to find dead transitions.
[2024-06-01 06:12:41] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:12:41] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:12:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:13:05] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2099/2099 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:13:33] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
Problem TDEAD1197 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1285 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 7 constraints, problems are : Problem set: 9 solved, 2090 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2099 constraints, Known Traps: 2/2 constraints]
After SMT, in 54224ms problems are : Problem set: 9 solved, 2090 unsolved
Search for dead transitions found 9 dead transitions in 54247ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
[2024-06-01 06:13:35] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
[2024-06-01 06:13:35] [INFO ] Invariant cache hit.
[2024-06-01 06:13:35] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 06:13:35] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
[2024-06-01 06:13:35] [INFO ] Invariant cache hit.
[2024-06-01 06:13:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:13:37] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1533 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/186 places, 2093/2103 transitions.
Applied a total of 0 rules in 175 ms. Remains 183 /183 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56184 ms. Remains : 183/186 places, 2093/2103 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
Product exploration explored 100000 steps with 1728 reset in 562 ms.
Product exploration explored 100000 steps with 1713 reset in 481 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2093 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 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 233 steps (0 resets) in 8 ms. (25 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 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-06-01 06:13:38] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-06-01 06:13:38] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:13:39] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:13:40] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2024-06-01 06:13:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:13:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 06:13:41] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 06:13:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:13:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 399 ms returned sat
[2024-06-01 06:13:42] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2024-06-01 06:13:43] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1717 ms
Could not prove EG (NOT p0)
Support contains 1 out of 183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2093/2093 transitions.
Applied a total of 0 rules in 204 ms. Remains 183 /183 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Running 2090 sub problems to find dead transitions.
[2024-06-01 06:13:43] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
[2024-06-01 06:13:43] [INFO ] Invariant cache hit.
[2024-06-01 06:13:43] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
[2024-06-01 06:14:06] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/552 variables, and 6 constraints, problems are : Problem set: 0 solved, 2090 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2090/2090 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2090 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 19)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/552 variables, and 6 constraints, problems are : Problem set: 0 solved, 2090 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2090 constraints, Known Traps: 1/1 constraints]
After SMT, in 52689ms problems are : Problem set: 0 solved, 2090 unsolved
Search for dead transitions found 0 dead transitions in 52714ms
[2024-06-01 06:14:36] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
[2024-06-01 06:14:36] [INFO ] Invariant cache hit.
[2024-06-01 06:14:36] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-01 06:14:36] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
[2024-06-01 06:14:36] [INFO ] Invariant cache hit.
[2024-06-01 06:14:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:14:37] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
[2024-06-01 06:14:37] [INFO ] Redundant transitions in 35 ms returned []
Running 2090 sub problems to find dead transitions.
[2024-06-01 06:14:37] [INFO ] Flow matrix only has 369 transitions (discarded 1724 similar events)
[2024-06-01 06:14:37] [INFO ] Invariant cache hit.
[2024-06-01 06:14:37] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
[2024-06-01 06:14:59] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2024-06-01 06:15:16] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
Problem TDEAD1287 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1617 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/552 variables, and 7 constraints, problems are : Problem set: 31 solved, 2059 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2090/2090 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 31 solved, 2059 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 31 solved, 2059 unsolved
Problem TDEAD1628 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD2002 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 2/7 constraints. Problems are: Problem set: 66 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/552 variables, and 7 constraints, problems are : Problem set: 66 solved, 2024 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2090 constraints, Known Traps: 2/2 constraints]
After SMT, in 72515ms problems are : Problem set: 66 solved, 2024 unsolved
Search for dead transitions found 66 dead transitions in 72533ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 183/183 places, 2027/2093 transitions.
Applied a total of 0 rules in 154 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-06-01 06:15:50] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 126729 ms. Remains : 183/183 places, 2027/2093 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2027 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 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 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 175 steps (0 resets) in 6 ms. (25 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 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2024-06-01 06:15:50] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-06-01 06:15:50] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:15:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:15:52] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2024-06-01 06:15:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:15:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 06:15:53] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-01 06:15:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:15:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:15:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 3011 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1707 reset in 623 ms.
Product exploration explored 100000 steps with 1733 reset in 471 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 153 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:15:57] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:15:57] [INFO ] Invariant cache hit.
[2024-06-01 06:15:57] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 52385ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 52408ms
[2024-06-01 06:16:49] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:16:49] [INFO ] Invariant cache hit.
[2024-06-01 06:16:50] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 06:16:50] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:16:50] [INFO ] Invariant cache hit.
[2024-06-01 06:16:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:16:52] [INFO ] Implicit Places using invariants and state equation in 2283 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
[2024-06-01 06:16:52] [INFO ] Redundant transitions in 74 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-06-01 06:16:52] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-06-01 06:16:52] [INFO ] Invariant cache hit.
[2024-06-01 06:16:52] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-06-01 06:17:14] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 72724ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 72750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127970 ms. Remains : 183/183 places, 2027/2027 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-09 finished in 324367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(p2))))))'
Support contains 10 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 228 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:18:05] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:18:05] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 06:18:05] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:18:28] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54163ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54185ms
[2024-06-01 06:18:59] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:18:59] [INFO ] Invariant cache hit.
[2024-06-01 06:19:00] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 06:19:00] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:19:00] [INFO ] Invariant cache hit.
[2024-06-01 06:19:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:19:00] [INFO ] Implicit Places using invariants and state equation in 779 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1076 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 191 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55686 ms. Remains : 185/186 places, 2103/2103 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
Product exploration explored 100000 steps with 1535 reset in 588 ms.
Product exploration explored 100000 steps with 1551 reset in 741 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 150 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 1896 steps (0 resets) in 19 ms. (94 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 156 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 6 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 180 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:19:03] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 185 cols
[2024-06-01 06:19:03] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:19:03] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:19:27] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54161ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54179ms
[2024-06-01 06:19:57] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:19:57] [INFO ] Invariant cache hit.
[2024-06-01 06:19:57] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 06:19:57] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:19:57] [INFO ] Invariant cache hit.
[2024-06-01 06:19:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:19:58] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2024-06-01 06:19:58] [INFO ] Redundant transitions in 64 ms returned []
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:19:58] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:19:58] [INFO ] Invariant cache hit.
[2024-06-01 06:19:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:20:22] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2024-06-01 06:20:39] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1429 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 7 constraints, problems are : Problem set: 22 solved, 2078 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 22 solved, 2078 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 2078 unsolved
Problem TDEAD1440 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2012 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 75 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 75 solved, 2025 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 74141ms problems are : Problem set: 75 solved, 2025 unsolved
Search for dead transitions found 75 dead transitions in 74165ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 185/185 places, 2028/2103 transitions.
Applied a total of 0 rules in 220 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:21:13] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 129823 ms. Remains : 185/185 places, 2028/2103 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 1541 steps (0 resets) in 18 ms. (81 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1561 reset in 628 ms.
Product exploration explored 100000 steps with 1558 reset in 561 ms.
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 134 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:21:15] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:21:15] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 06:21:15] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:21:37] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 52681ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52700ms
[2024-06-01 06:22:07] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:22:07] [INFO ] Invariant cache hit.
[2024-06-01 06:22:08] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-01 06:22:08] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:22:08] [INFO ] Invariant cache hit.
[2024-06-01 06:22:08] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:22:08] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2024-06-01 06:22:09] [INFO ] Redundant transitions in 54 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:22:09] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:22:09] [INFO ] Invariant cache hit.
[2024-06-01 06:22:09] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:22:31] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 73209ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73231ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127354 ms. Remains : 185/185 places, 2028/2028 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-10 finished in 317130 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)&&F(G(p1)))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 187 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:23:22] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:23:22] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 06:23:22] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:23:45] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54128ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54150ms
[2024-06-01 06:24:16] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:24:16] [INFO ] Invariant cache hit.
[2024-06-01 06:24:17] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-06-01 06:24:17] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:24:17] [INFO ] Invariant cache hit.
[2024-06-01 06:24:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:24:18] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1517 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 186 ms. Remains 184 /184 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56048 ms. Remains : 184/186 places, 2103/2103 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
Product exploration explored 100000 steps with 187 reset in 604 ms.
Product exploration explored 100000 steps with 205 reset in 590 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 224 steps (0 resets) in 8 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2103/2103 transitions.
Applied a total of 0 rules in 187 ms. Remains 184 /184 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:24:20] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 184 cols
[2024-06-01 06:24:20] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 06:24:20] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:24:44] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54040ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54070ms
[2024-06-01 06:25:14] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:25:14] [INFO ] Invariant cache hit.
[2024-06-01 06:25:15] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 06:25:15] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:25:15] [INFO ] Invariant cache hit.
[2024-06-01 06:25:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:25:17] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 2692 ms to find 0 implicit places.
[2024-06-01 06:25:17] [INFO ] Redundant transitions in 35 ms returned []
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:25:17] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:25:17] [INFO ] Invariant cache hit.
[2024-06-01 06:25:17] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:25:40] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1561 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 7 constraints, problems are : Problem set: 34 solved, 2066 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 34 solved, 2066 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 34 solved, 2066 unsolved
Problem TDEAD1572 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2012 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 75 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 75 solved, 2025 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 73509ms problems are : Problem set: 75 solved, 2025 unsolved
Search for dead transitions found 75 dead transitions in 73528ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 184/184 places, 2028/2103 transitions.
Applied a total of 0 rules in 136 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:26:31] [INFO ] Redundant transitions in 29 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 130707 ms. Remains : 184/184 places, 2028/2103 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 136 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 194 reset in 848 ms.
Product exploration explored 100000 steps with 204 reset in 701 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 132 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:26:34] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 06:26:34] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 06:26:34] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 52386ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52402ms
[2024-06-01 06:27:26] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:27:26] [INFO ] Invariant cache hit.
[2024-06-01 06:27:26] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 06:27:26] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:27:26] [INFO ] Invariant cache hit.
[2024-06-01 06:27:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:27:29] [INFO ] Implicit Places using invariants and state equation in 2537 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
[2024-06-01 06:27:29] [INFO ] Redundant transitions in 70 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:27:29] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:27:29] [INFO ] Invariant cache hit.
[2024-06-01 06:27:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 72473ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 72499ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127966 ms. Remains : 184/184 places, 2028/2028 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-12 finished in 319525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||((p2||X(F((p2&&F(p0))))) U !p1)))'
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 20 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:28:42] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:28:42] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:28:42] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:29:05] [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 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54311ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54347ms
[2024-06-01 06:29:36] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:29:36] [INFO ] Invariant cache hit.
[2024-06-01 06:29:36] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 06:29:36] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:29:36] [INFO ] Invariant cache hit.
[2024-06-01 06:29:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:29:37] [INFO ] Implicit Places using invariants and state equation in 777 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1051 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 10 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55435 ms. Remains : 185/186 places, 2103/2103 transitions.
Stuttering acceptance computed with spot in 165 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
Product exploration explored 100000 steps with 11315 reset in 685 ms.
Product exploration explored 100000 steps with 11627 reset in 663 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 113 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (56 resets) in 459 ms. (86 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
[2024-06-01 06:29:39] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 185 cols
[2024-06-01 06:29:39] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:29:39] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 163/554 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/554 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 153 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:29:41] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:29:41] [INFO ] Invariant cache hit.
[2024-06-01 06:29:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:30:34] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 10 solved, 2090 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 54466ms problems are : Problem set: 10 solved, 2090 unsolved
Search for dead transitions found 10 dead transitions in 54490ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/185 places, 2093/2103 transitions.
Applied a total of 0 rules in 127 ms. Remains 185 /185 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54779 ms. Remains : 185/185 places, 2093/2103 transitions.
RANDOM walk for 40000 steps (56 resets) in 475 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386098 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386098 steps, saw 105680 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-06-01 06:30:39] [INFO ] Flow matrix only has 370 transitions (discarded 1723 similar events)
[2024-06-01 06:30:39] [INFO ] Invariant cache hit.
[2024-06-01 06:30:39] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 163/554 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/554 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2093/2093 transitions.
Applied a total of 0 rules in 153 ms. Remains 185 /185 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 185/185 places, 2093/2093 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2093/2093 transitions.
Applied a total of 0 rules in 150 ms. Remains 185 /185 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
[2024-06-01 06:30:41] [INFO ] Flow matrix only has 370 transitions (discarded 1723 similar events)
[2024-06-01 06:30:41] [INFO ] Invariant cache hit.
[2024-06-01 06:30:41] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-06-01 06:30:41] [INFO ] Flow matrix only has 370 transitions (discarded 1723 similar events)
[2024-06-01 06:30:41] [INFO ] Invariant cache hit.
[2024-06-01 06:30:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:30:44] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 3182 ms to find 0 implicit places.
[2024-06-01 06:30:44] [INFO ] Redundant transitions in 73 ms returned []
Running 2090 sub problems to find dead transitions.
[2024-06-01 06:30:44] [INFO ] Flow matrix only has 370 transitions (discarded 1723 similar events)
[2024-06-01 06:30:44] [INFO ] Invariant cache hit.
[2024-06-01 06:30:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
Problem TDEAD1298 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1727 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 7 constraints, problems are : Problem set: 40 solved, 2050 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2090/2090 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 40 solved, 2050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 40 solved, 2050 unsolved
Problem TDEAD1738 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD2002 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 65 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 65 solved, 2025 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2090 constraints, Known Traps: 2/2 constraints]
After SMT, in 74365ms problems are : Problem set: 65 solved, 2025 unsolved
Search for dead transitions found 65 dead transitions in 74391ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/185 places, 2028/2093 transitions.
Applied a total of 0 rules in 139 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:31:59] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78002 ms. Remains : 185/185 places, 2028/2093 transitions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 22 factoid took 434 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 12 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:31:59] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:31:59] [INFO ] Invariant cache hit.
[2024-06-01 06:31:59] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:32:23] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54110ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54132ms
[2024-06-01 06:32:54] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:32:54] [INFO ] Invariant cache hit.
[2024-06-01 06:32:54] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 06:32:54] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:32:54] [INFO ] Invariant cache hit.
[2024-06-01 06:32:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:32:57] [INFO ] Implicit Places using invariants and state equation in 3300 ms returned []
Implicit Place search using SMT with State Equation took 3640 ms to find 0 implicit places.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:32:57] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:32:57] [INFO ] Invariant cache hit.
[2024-06-01 06:32:57] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
SMT process timed out in 43885ms, After SMT, problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 43923ms
Finished structural reductions in LTL mode , in 1 iterations and 101723 ms. Remains : 185/185 places, 2103/2103 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 184 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (56 resets) in 548 ms. (72 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2024-06-01 06:33:42] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:33:42] [INFO ] Invariant cache hit.
[2024-06-01 06:33:42] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 163/554 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:33:43] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/554 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 153 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:33:44] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:33:44] [INFO ] Invariant cache hit.
[2024-06-01 06:33:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:34:07] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 19)
(s84 0)
(s85 1)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54131ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54312 ms. Remains : 185/185 places, 2103/2103 transitions.
RANDOM walk for 40000 steps (56 resets) in 416 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 390534 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 390534 steps, saw 106886 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2024-06-01 06:34:41] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:34:41] [INFO ] Invariant cache hit.
[2024-06-01 06:34:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 163/554 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/554 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1559ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 160 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 185/185 places, 2103/2103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 156 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
[2024-06-01 06:34:43] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:34:43] [INFO ] Invariant cache hit.
[2024-06-01 06:34:43] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 06:34:43] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:34:43] [INFO ] Invariant cache hit.
[2024-06-01 06:34:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:34:46] [INFO ] Implicit Places using invariants and state equation in 2841 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
[2024-06-01 06:34:46] [INFO ] Redundant transitions in 77 ms returned []
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:34:46] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:34:46] [INFO ] Invariant cache hit.
[2024-06-01 06:34:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 3 ms to minimize.
[2024-06-01 06:35:28] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1352 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 7 constraints, problems are : Problem set: 15 solved, 2085 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 15 solved, 2085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 15 solved, 2085 unsolved
Problem TDEAD1363 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2012 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 75 solved, 2025 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 75 solved, 2025 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 3 (OVERLAPS) 370/555 variables, 185/192 constraints. Problems are: Problem set: 77 solved, 2023 unsolved
SMT process timed out in 74314ms, After SMT, problems are : Problem set: 77 solved, 2023 unsolved
Search for dead transitions found 77 dead transitions in 74340ms
Found 77 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 77 transitions
Dead transitions reduction (with SMT) removed 77 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/185 places, 2026/2103 transitions.
Applied a total of 0 rules in 136 ms. Remains 185 /185 variables (removed 0) and now considering 2026/2026 (removed 0) transitions.
[2024-06-01 06:36:01] [INFO ] Redundant transitions in 34 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77953 ms. Remains : 185/185 places, 2026/2103 transitions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 22 factoid took 609 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 249 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11769 reset in 958 ms.
Product exploration explored 100000 steps with 10618 reset in 670 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 268 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 188 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:36:05] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:36:05] [INFO ] Invariant cache hit.
[2024-06-01 06:36:05] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1407 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 20 solved, 2080 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 53932ms problems are : Problem set: 20 solved, 2080 unsolved
Search for dead transitions found 20 dead transitions in 53955ms
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:36:59] [INFO ] Redundant transitions in 34 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 185/185 places, 2083/2103 transitions.
Applied a total of 0 rules in 213 ms. Remains 185 /185 variables (removed 0) and now considering 2083/2083 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54399 ms. Remains : 185/185 places, 2083/2103 transitions.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 19 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:36:59] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:36:59] [INFO ] Invariant cache hit.
[2024-06-01 06:36:59] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:37:21] [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 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:37:50] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 14 solved, 2086 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 53030ms problems are : Problem set: 14 solved, 2086 unsolved
Search for dead transitions found 14 dead transitions in 53052ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 14 transitions.
[2024-06-01 06:37:52] [INFO ] Flow matrix only has 370 transitions (discarded 1719 similar events)
[2024-06-01 06:37:52] [INFO ] Invariant cache hit.
[2024-06-01 06:37:52] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 06:37:52] [INFO ] Flow matrix only has 370 transitions (discarded 1719 similar events)
[2024-06-01 06:37:52] [INFO ] Invariant cache hit.
[2024-06-01 06:37:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:37:55] [INFO ] Implicit Places using invariants and state equation in 3257 ms returned []
Implicit Place search using SMT with State Equation took 3591 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/185 places, 2089/2103 transitions.
Applied a total of 0 rules in 24 ms. Remains 185 /185 variables (removed 0) and now considering 2089/2089 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56691 ms. Remains : 185/185 places, 2089/2103 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-13 finished in 554159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Applied a total of 2 rules in 41 ms. Remains 185 /186 variables (removed 1) and now considering 2102/2103 (removed 1) transitions.
Running 2099 sub problems to find dead transitions.
[2024-06-01 06:37:56] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:37:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:37:56] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:38:19] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2099/2099 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2099 constraints, Known Traps: 1/1 constraints]
After SMT, in 53952ms problems are : Problem set: 0 solved, 2099 unsolved
Search for dead transitions found 0 dead transitions in 53979ms
[2024-06-01 06:38:50] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:38:50] [INFO ] Invariant cache hit.
[2024-06-01 06:38:50] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 06:38:50] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:38:50] [INFO ] Invariant cache hit.
[2024-06-01 06:38:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:38:51] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1468 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2102/2103 transitions.
Applied a total of 0 rules in 14 ms. Remains 183 /183 variables (removed 0) and now considering 2102/2102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55509 ms. Remains : 183/186 places, 2102/2103 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 735 ms.
Product exploration explored 100000 steps with 50000 reset in 808 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/183 stabilizing places and 323/2102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 13 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-14 finished in 57223 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 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2102
Applied a total of 2 rules in 168 ms. Remains 185 /186 variables (removed 1) and now considering 2102/2103 (removed 1) transitions.
Running 2099 sub problems to find dead transitions.
[2024-06-01 06:38:53] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:38:53] [INFO ] Invariant cache hit.
[2024-06-01 06:38:53] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2099/2099 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2099 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2099 constraints, Known Traps: 1/1 constraints]
After SMT, in 54097ms problems are : Problem set: 0 solved, 2099 unsolved
Search for dead transitions found 0 dead transitions in 54114ms
[2024-06-01 06:39:47] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:39:47] [INFO ] Invariant cache hit.
[2024-06-01 06:39:48] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-06-01 06:39:48] [INFO ] Flow matrix only has 369 transitions (discarded 1733 similar events)
[2024-06-01 06:39:48] [INFO ] Invariant cache hit.
[2024-06-01 06:39:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:39:49] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1379 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 184/186 places, 2102/2103 transitions.
Applied a total of 0 rules in 174 ms. Remains 184 /184 variables (removed 0) and now considering 2102/2102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55839 ms. Remains : 184/186 places, 2102/2103 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-15
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-15 finished in 55925 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(p1)||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' '!(F((p0||G((F(p0)&&(p1 U p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(p2))))))'
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)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||((p2||X(F((p2&&F(p0))))) U !p1)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
Stuttering acceptance computed with spot in 259 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 186/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 50 ms. Remains 186 /186 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:39:50] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:39:50] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:39:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:40:14] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 53758ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 53784ms
[2024-06-01 06:40:44] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:40:44] [INFO ] Invariant cache hit.
[2024-06-01 06:40:44] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 06:40:44] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:40:44] [INFO ] Invariant cache hit.
[2024-06-01 06:40:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:40:45] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1435 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 185/186 places, 2103/2103 transitions.
Applied a total of 0 rules in 32 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 55306 ms. Remains : 185/186 places, 2103/2103 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
Product exploration explored 100000 steps with 11344 reset in 936 ms.
Product exploration explored 100000 steps with 11552 reset in 717 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 183 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (56 resets) in 370 ms. (107 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
[2024-06-01 06:40:47] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
// Phase 1: matrix 370 rows 185 cols
[2024-06-01 06:40:47] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:40:48] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 163/554 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/554 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 195 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:40:49] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:40:49] [INFO ] Invariant cache hit.
[2024-06-01 06:40:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:41:13] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54269ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54495 ms. Remains : 185/185 places, 2103/2103 transitions.
RANDOM walk for 40001 steps (56 resets) in 454 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (20 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 330666 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 330666 steps, saw 90756 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-01 06:41:47] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:41:47] [INFO ] Invariant cache hit.
[2024-06-01 06:41:47] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 163/554 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/391 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/554 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 153 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 185/185 places, 2103/2103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 156 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
[2024-06-01 06:41:49] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:41:49] [INFO ] Invariant cache hit.
[2024-06-01 06:41:49] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 06:41:49] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:41:49] [INFO ] Invariant cache hit.
[2024-06-01 06:41:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:41:52] [INFO ] Implicit Places using invariants and state equation in 2679 ms returned []
Implicit Place search using SMT with State Equation took 3016 ms to find 0 implicit places.
[2024-06-01 06:41:52] [INFO ] Redundant transitions in 79 ms returned []
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:41:52] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:41:52] [INFO ] Invariant cache hit.
[2024-06-01 06:41:52] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 7 constraints, problems are : Problem set: 14 solved, 2086 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2086 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 14 solved, 2086 unsolved
Problem TDEAD1352 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2012 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 75 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 75 solved, 2025 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 74323ms problems are : Problem set: 75 solved, 2025 unsolved
Search for dead transitions found 75 dead transitions in 74348ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/185 places, 2028/2103 transitions.
Applied a total of 0 rules in 116 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:43:06] [INFO ] Redundant transitions in 31 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77768 ms. Remains : 185/185 places, 2028/2103 transitions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 22 factoid took 609 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 243 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2103/2103 transitions.
Applied a total of 0 rules in 13 ms. Remains 185 /185 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:43:07] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:43:07] [INFO ] Invariant cache hit.
[2024-06-01 06:43:07] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 1/1 constraints]
After SMT, in 54273ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54294ms
[2024-06-01 06:44:02] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:44:02] [INFO ] Invariant cache hit.
[2024-06-01 06:44:02] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-01 06:44:02] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:44:02] [INFO ] Invariant cache hit.
[2024-06-01 06:44:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:44:05] [INFO ] Implicit Places using invariants and state equation in 2769 ms returned []
Implicit Place search using SMT with State Equation took 3092 ms to find 0 implicit places.
Running 2100 sub problems to find dead transitions.
[2024-06-01 06:44:05] [INFO ] Flow matrix only has 370 transitions (discarded 1733 similar events)
[2024-06-01 06:44:05] [INFO ] Invariant cache hit.
[2024-06-01 06:44:05] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1451 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 7 constraints, problems are : Problem set: 24 solved, 2076 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 24 solved, 2076 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 24 solved, 2076 unsolved
Problem TDEAD1462 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2012 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 75 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 7 constraints, problems are : Problem set: 75 solved, 2025 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 2/2 constraints]
After SMT, in 73958ms problems are : Problem set: 75 solved, 2025 unsolved
Search for dead transitions found 75 dead transitions in 73992ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/185 places, 2028/2103 transitions.
Applied a total of 0 rules in 13 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131415 ms. Remains : 185/185 places, 2028/2103 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/185 stabilizing places and 324/2028 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 181 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (56 resets) in 424 ms. (94 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2024-06-01 06:45:20] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:45:20] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 06:45:20] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/553 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/554 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/554 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 288/390 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/553 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1669ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 139 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:45:22] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:45:22] [INFO ] Invariant cache hit.
[2024-06-01 06:45:22] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:45:43] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 52617ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52781 ms. Remains : 185/185 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 307305 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 307305 steps, saw 84577 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-06-01 06:46:17] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:46:17] [INFO ] Invariant cache hit.
[2024-06-01 06:46:17] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 163/553 variables, 82/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/553 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/554 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/554 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 137 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 185/185 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 137 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:46:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:46:19] [INFO ] Invariant cache hit.
[2024-06-01 06:46:19] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 06:46:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:46:19] [INFO ] Invariant cache hit.
[2024-06-01 06:46:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:46:22] [INFO ] Implicit Places using invariants and state equation in 2323 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
[2024-06-01 06:46:22] [INFO ] Redundant transitions in 75 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:46:22] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:46:22] [INFO ] Invariant cache hit.
[2024-06-01 06:46:22] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:46:43] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 71855ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 71880ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74760 ms. Remains : 185/185 places, 2028/2028 transitions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 22 factoid took 658 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 308 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10897 reset in 944 ms.
Product exploration explored 100000 steps with 11715 reset in 811 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 320 ms :[false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 181 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:47:38] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:47:38] [INFO ] Invariant cache hit.
[2024-06-01 06:47:38] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:48:00] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 53190ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 53217ms
[2024-06-01 06:48:31] [INFO ] Redundant transitions in 32 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:48:31] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:48:31] [INFO ] Invariant cache hit.
[2024-06-01 06:48:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
SMT process timed out in 73121ms, After SMT, problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 126584 ms. Remains : 185/185 places, 2028/2028 transitions.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 2028/2028 transitions.
Applied a total of 0 rules in 8 ms. Remains 185 /185 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:49:44] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:49:44] [INFO ] Invariant cache hit.
[2024-06-01 06:49:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:50:07] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 52438ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52455ms
[2024-06-01 06:50:36] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:50:36] [INFO ] Invariant cache hit.
[2024-06-01 06:50:37] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 06:50:37] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:50:37] [INFO ] Invariant cache hit.
[2024-06-01 06:50:37] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:50:39] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
Running 2025 sub problems to find dead transitions.
[2024-06-01 06:50:39] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-06-01 06:50:39] [INFO ] Invariant cache hit.
[2024-06-01 06:50:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 06:51:01] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 72541ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 72578ms
Finished structural reductions in LTL mode , in 1 iterations and 127456 ms. Remains : 185/185 places, 2028/2028 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-13 finished in 722222 ms.
[2024-06-01 06:51:52] [INFO ] Flatten gal took : 89 ms
[2024-06-01 06:51:52] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 06:51:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 186 places, 2103 transitions and 15908 arcs took 18 ms.
Total runtime 2970475 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717224996336

--------------------
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-V80P20N10-LTLFireability-00
ltl formula formula --ltl=/tmp/2729/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 2103 transitions and 15908 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.280 real 0.060 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2729/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2729/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2729/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2729/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
ltl formula formula --ltl=/tmp/2729/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 2103 transitions and 15908 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.190 real 0.070 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2729/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2729/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2729/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2729/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 189 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 2104 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): ~195 levels ~10000 states ~15660 transitions
pnml2lts-mc( 3/ 4): ~195 levels ~20000 states ~30576 transitions
pnml2lts-mc( 3/ 4): ~195 levels ~40000 states ~67680 transitions
pnml2lts-mc( 3/ 4): ~195 levels ~80000 states ~187040 transitions
pnml2lts-mc( 3/ 4): ~195 levels ~160000 states ~441804 transitions
pnml2lts-mc( 3/ 4): ~195 levels ~320000 states ~1012056 transitions
pnml2lts-mc( 3/ 4): ~195 levels ~640000 states ~2197640 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~1280000 states ~4438736 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~2560000 states ~8727180 transitions
pnml2lts-mc( 1/ 4): ~440 levels ~5120000 states ~15462276 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: 5568618
pnml2lts-mc( 0/ 4): unique states count: 5568618
pnml2lts-mc( 0/ 4): unique transitions count: 18255537
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13794984
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6182508
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1448
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6182508 states 20191315 transitions, fanout: 3.266
pnml2lts-mc( 0/ 4): Total exploration time 92.480 sec (92.480 sec minimum, 92.480 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66852, Transitions per second: 218332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 89.9MB, 16.9 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/74.0%
pnml2lts-mc( 0/ 4): Stored 2160 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 89.9MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
ltl formula formula --ltl=/tmp/2729/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 2103 transitions and 15908 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.050 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2729/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2729/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2729/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2729/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 188 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 2136 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): ~674 levels ~10000 states ~26648 transitions
pnml2lts-mc( 3/ 4): ~674 levels ~20000 states ~54988 transitions
pnml2lts-mc( 3/ 4): ~674 levels ~40000 states ~138368 transitions
pnml2lts-mc( 3/ 4): ~674 levels ~80000 states ~290712 transitions
pnml2lts-mc( 2/ 4): ~677 levels ~160000 states ~552492 transitions
pnml2lts-mc( 2/ 4): ~677 levels ~320000 states ~1107428 transitions
pnml2lts-mc( 2/ 4): ~677 levels ~640000 states ~2217272 transitions
pnml2lts-mc( 2/ 4): ~677 levels ~1280000 states ~4814600 transitions
pnml2lts-mc( 2/ 4): ~677 levels ~2560000 states ~10451156 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4843031
pnml2lts-mc( 0/ 4): unique states count: 4845178
pnml2lts-mc( 0/ 4): unique transitions count: 20063639
pnml2lts-mc( 0/ 4): - self-loop count: 49
pnml2lts-mc( 0/ 4): - claim dead count: 15212107
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4845778
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2709
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4845778 states 20065603 transitions, fanout: 4.141
pnml2lts-mc( 0/ 4): Total exploration time 76.110 sec (76.080 sec minimum, 76.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 63668, Transitions per second: 263640
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 101.0MB, 21.8 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2160 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 101.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
ltl formula formula --ltl=/tmp/2729/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 2103 transitions and 15908 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.290 real 0.070 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2729/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2729/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2729/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2729/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 188 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 2113 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): ~677 levels ~10000 states ~34316 transitions
pnml2lts-mc( 3/ 4): ~677 levels ~20000 states ~85728 transitions
pnml2lts-mc( 3/ 4): ~677 levels ~40000 states ~187376 transitions
pnml2lts-mc( 1/ 4): ~675 levels ~80000 states ~377528 transitions
pnml2lts-mc( 1/ 4): ~675 levels ~160000 states ~771356 transitions
pnml2lts-mc( 1/ 4): ~675 levels ~320000 states ~1564944 transitions
pnml2lts-mc( 3/ 4): ~677 levels ~640000 states ~3128220 transitions
pnml2lts-mc( 0/ 4): ~675 levels ~1280000 states ~6510552 transitions
pnml2lts-mc( 0/ 4): ~675 levels ~2560000 states ~13092884 transitions
pnml2lts-mc( 3/ 4): ~677 levels ~5120000 states ~25831808 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6638543
pnml2lts-mc( 0/ 4): unique states count: 6640337
pnml2lts-mc( 0/ 4): unique transitions count: 37867592
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 32490092
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7047961
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2706
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7047961 states 40136032 transitions, fanout: 5.695
pnml2lts-mc( 0/ 4): Total exploration time 110.380 sec (110.370 sec minimum, 110.375 sec on average)
pnml2lts-mc( 0/ 4): States per second: 63852, Transitions per second: 363617
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 114.7MB, 18.1 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2160 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 114.7MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
ltl formula formula --ltl=/tmp/2729/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 2103 transitions and 15908 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.250 real 0.090 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2729/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2729/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2729/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2729/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 189 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 2244 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~674 levels ~10000 states ~63764 transitions
pnml2lts-mc( 2/ 4): ~674 levels ~20000 states ~143620 transitions
pnml2lts-mc( 2/ 4): ~674 levels ~40000 states ~270196 transitions
pnml2lts-mc( 2/ 4): ~674 levels ~80000 states ~561576 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~714!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 91079
pnml2lts-mc( 0/ 4): unique states count: 93433
pnml2lts-mc( 0/ 4): unique transitions count: 758214
pnml2lts-mc( 0/ 4): - self-loop count: 82
pnml2lts-mc( 0/ 4): - claim dead count: 663728
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 97026
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2748
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 97026 states 792296 transitions, fanout: 8.166
pnml2lts-mc( 0/ 4): Total exploration time 1.920 sec (1.920 sec minimum, 1.920 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50534, Transitions per second: 412654
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.0MB, 31.8 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 2160 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.0MB (~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-V80P20N10"
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-V80P20N10, 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-171620399200276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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