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.r047-tajo-171620397800259.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 greatspnxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 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 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K 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 2.0M 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-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716289034205

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:57:15] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 10:57:15] [INFO ] Transformed 138 places.
[2024-05-21 10:57:15] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:57:15] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 48 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:57:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 10:57:16] [INFO ] Computed 7 invariants in 32 ms
[2024-05-21 10:57:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:57:42] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:58:12] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
Problem TDEAD1248 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 7 constraints, problems are : Problem set: 1 solved, 2344 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 56671ms problems are : Problem set: 1 solved, 2344 unsolved
Search for dead transitions found 1 dead transitions in 56730ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-05-21 10:58:12] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 10:58:12] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:58:13] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-21 10:58:13] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 10:58:13] [INFO ] Invariant cache hit.
[2024-05-21 10:58:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:58:13] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57961 ms. Remains : 138/138 places, 2347/2348 transitions.
Support contains 22 out of 138 places after structural reductions.
[2024-05-21 10:58:14] [INFO ] Flatten gal took : 175 ms
[2024-05-21 10:58:14] [INFO ] Flatten gal took : 125 ms
[2024-05-21 10:58:14] [INFO ] Input system was already deterministic with 2347 transitions.
RANDOM walk for 40000 steps (92 resets) in 3207 ms. (12 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40003 steps (44 resets) in 380 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 246 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (32 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (28 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
[2024-05-21 10:58:16] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 10:58:16] [INFO ] Invariant cache hit.
[2024-05-21 10:58:16] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/87 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 10:58:16] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 290/377 variables, 87/94 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 42/136 constraints. Problems are: Problem set: 5 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/136 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 51/428 variables, 51/187 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/188 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/188 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/428 variables, 0/188 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 188 constraints, problems are : Problem set: 5 solved, 3 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/36 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 290/326 variables, 36/42 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 42/84 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 102/428 variables, 102/186 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/188 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 3/191 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 0/191 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/428 variables, 0/191 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 191 constraints, problems are : Problem set: 5 solved, 3 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1327ms problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1004 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2346
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2346
Applied a total of 3 rules in 538 ms. Remains 135 /138 variables (removed 3) and now considering 2346/2347 (removed 1) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 10:58:19] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:58:19] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:58:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:58:45] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 10:59:15] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
Problem TDEAD1267 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1372 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 7 constraints, problems are : Problem set: 6 solved, 2337 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 57796ms problems are : Problem set: 6 solved, 2337 unsolved
Search for dead transitions found 6 dead transitions in 57830ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/138 places, 2340/2347 transitions.
Applied a total of 0 rules in 292 ms. Remains 135 /135 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58670 ms. Remains : 135/138 places, 2340/2347 transitions.
RANDOM walk for 40000 steps (92 resets) in 755 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40007 steps (32 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 269869 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 3
Probabilistic random walk after 269869 steps, saw 72232 distinct states, run finished after 3005 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-21 10:59:20] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:59:20] [INFO ] Invariant cache hit.
[2024-05-21 10:59:20] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 187/216 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:59:21] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 206/422 variables, 104/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/424 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 183 constraints, problems are : Problem set: 0 solved, 3 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 187/216 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 206/422 variables, 104/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/424 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 186 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1939ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 754 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2340/2340 transitions.
Applied a total of 0 rules in 184 ms. Remains 135 /135 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 135/135 places, 2340/2340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2340/2340 transitions.
Applied a total of 0 rules in 164 ms. Remains 135 /135 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
[2024-05-21 10:59:23] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:59:23] [INFO ] Invariant cache hit.
[2024-05-21 10:59:24] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-21 10:59:24] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:59:24] [INFO ] Invariant cache hit.
[2024-05-21 10:59:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:25] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1535 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2340/2340 transitions.
Applied a total of 0 rules in 194 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1895 ms. Remains : 133/135 places, 2340/2340 transitions.
RANDOM walk for 40000 steps (92 resets) in 491 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40013 steps (32 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 268210 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 3
Probabilistic random walk after 268210 steps, saw 71788 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-21 10:59:28] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 10:59:28] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:59:28] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 187/216 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:59:29] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 204/420 variables, 102/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/422 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 187/216 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 204/420 variables, 102/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/422 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 184 constraints, problems are : Problem set: 0 solved, 3 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1577ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 866 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2340/2340 transitions.
Applied a total of 0 rules in 187 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 133/133 places, 2340/2340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2340/2340 transitions.
Applied a total of 0 rules in 181 ms. Remains 133 /133 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
[2024-05-21 10:59:31] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:59:31] [INFO ] Invariant cache hit.
[2024-05-21 10:59:32] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-21 10:59:32] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:59:32] [INFO ] Invariant cache hit.
[2024-05-21 10:59:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:32] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2024-05-21 10:59:33] [INFO ] Redundant transitions in 132 ms returned []
Running 2337 sub problems to find dead transitions.
[2024-05-21 10:59:33] [INFO ] Flow matrix only has 289 transitions (discarded 2051 similar events)
[2024-05-21 10:59:33] [INFO ] Invariant cache hit.
[2024-05-21 10:59:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2337 unsolved
[2024-05-21 11:00:00] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2024-05-21 11:00:17] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
Problem TDEAD1387 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1765 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 19 solved, 2318 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2337/2337 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 2318 unsolved
Problem TDEAD1786 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2269 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 43 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 43 solved, 2294 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2337 constraints, Known Traps: 2/2 constraints]
After SMT, in 79283ms problems are : Problem set: 43 solved, 2294 unsolved
Search for dead transitions found 43 dead transitions in 79315ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/133 places, 2297/2340 transitions.
Applied a total of 0 rules in 210 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 11:00:52] [INFO ] Redundant transitions in 94 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81174 ms. Remains : 133/133 places, 2297/2340 transitions.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3849 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2347
Applied a total of 1 rules in 15 ms. Remains 137 /138 variables (removed 1) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:00:53] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-21 11:00:53] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 11:00:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:01:20] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 59149ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 59173ms
[2024-05-21 11:01:52] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:01:52] [INFO ] Invariant cache hit.
[2024-05-21 11:01:52] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-21 11:01:52] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:01:52] [INFO ] Invariant cache hit.
[2024-05-21 11:01:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:01:53] [INFO ] Implicit Places using invariants and state equation in 843 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1280 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60487 ms. Remains : 136/138 places, 2347/2347 transitions.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
Product exploration explored 100000 steps with 256 reset in 1000 ms.
Product exploration explored 100000 steps with 257 reset in 848 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3744 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.42 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1676 steps (0 resets) in 43 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:01:57] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 11:01:57] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 11:01:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:02:25] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:02:55] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
Problem TDEAD1268 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1352 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 1)
(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)
(s54 49)
(s55 0)
(s56 1)
(s57 1)
(s58 0)
(s59 0)
(s60 0)timeout

(s61 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/426 variables, and 7 constraints, problems are : Problem set: 5 solved, 2339 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 2/2 constraints]
After SMT, in 59678ms problems are : Problem set: 5 solved, 2339 unsolved
Search for dead transitions found 5 dead transitions in 59704ms
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-05-21 11:02:56] [INFO ] Flow matrix only has 290 transitions (discarded 2052 similar events)
[2024-05-21 11:02:56] [INFO ] Invariant cache hit.
[2024-05-21 11:02:57] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-21 11:02:57] [INFO ] Flow matrix only has 290 transitions (discarded 2052 similar events)
[2024-05-21 11:02:57] [INFO ] Invariant cache hit.
[2024-05-21 11:02:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:02:58] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/136 places, 2342/2347 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 2342/2342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61123 ms. Remains : 136/136 places, 2342/2347 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3739 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2342 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1700 steps (0 resets) in 64 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 317 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 251 reset in 903 ms.
Product exploration explored 100000 steps with 247 reset in 695 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2342/2342 transitions.
Applied a total of 0 rules in 24 ms. Remains 136 /136 variables (removed 0) and now considering 2342/2342 (removed 0) transitions.
Running 2339 sub problems to find dead transitions.
[2024-05-21 11:03:02] [INFO ] Flow matrix only has 290 transitions (discarded 2052 similar events)
[2024-05-21 11:03:02] [INFO ] Invariant cache hit.
[2024-05-21 11:03:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2339 unsolved
[2024-05-21 11:03:30] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2339 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2339/2339 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2339 unsolved
[2024-05-21 11:04:01] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
Problem TDEAD1368 is UNSAT
Problem TDEAD1389 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/426 variables, and 7 constraints, problems are : Problem set: 2 solved, 2337 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2339 constraints, Known Traps: 2/2 constraints]
After SMT, in 59148ms problems are : Problem set: 2 solved, 2337 unsolved
Search for dead transitions found 2 dead transitions in 59186ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 11:04:01] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 11:04:01] [INFO ] Invariant cache hit.
[2024-05-21 11:04:01] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 11:04:01] [INFO ] Flow matrix only has 290 transitions (discarded 2050 similar events)
[2024-05-21 11:04:01] [INFO ] Invariant cache hit.
[2024-05-21 11:04:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:04:02] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/136 places, 2340/2342 transitions.
Applied a total of 0 rules in 20 ms. Remains 136 /136 variables (removed 0) and now considering 2340/2340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 136/136 places, 2340/2342 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 finished in 189999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0&&G(p1)) U X((p2 U p3))))&&F(p1)))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2347
Applied a total of 1 rules in 47 ms. Remains 137 /138 variables (removed 1) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:04:03] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-21 11:04:03] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 11:04:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:04:31] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
[2024-05-21 11:05:03] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:05:03] [INFO ] Invariant cache hit.
[2024-05-21 11:05:03] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 11:05:03] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:05:03] [INFO ] Invariant cache hit.
[2024-05-21 11:05:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:05:04] [INFO ] Implicit Places using invariants and state equation in 980 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61680 ms. Remains : 136/138 places, 2347/2347 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 38 steps with 7 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 finished in 62252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||F((G(F(p2))||(p0&&F(p2)))))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 23 ms. Remains 138 /138 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:05:05] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 11:05:05] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 11:05:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:05:36] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
[2024-05-21 11:06:05] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:06:05] [INFO ] Invariant cache hit.
[2024-05-21 11:06:05] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 11:06:05] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:06:05] [INFO ] Invariant cache hit.
[2024-05-21 11:06:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:06:07] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1579 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61826 ms. Remains : 136/138 places, 2347/2347 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 1082 ms.
Product exploration explored 100000 steps with 50000 reset in 861 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 34 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 finished in 64088 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 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2346
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2346
Applied a total of 4 rules in 27 ms. Remains 135 /138 variables (removed 3) and now considering 2346/2347 (removed 1) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:06:09] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 11:06:09] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:06:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:06:36] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 59024ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 59055ms
[2024-05-21 11:07:08] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:07:08] [INFO ] Invariant cache hit.
[2024-05-21 11:07:08] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-21 11:07:08] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:07:08] [INFO ] Invariant cache hit.
[2024-05-21 11:07:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:07:10] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1723 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2346/2347 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60824 ms. Remains : 133/138 places, 2346/2347 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
Product exploration explored 100000 steps with 241 reset in 902 ms.
Product exploration explored 100000 steps with 241 reset in 673 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2346 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (92 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (32 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302024 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302024 steps, saw 80713 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-21 11:07:15] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 11:07:15] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:07:15] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2346/2346 transitions.
Applied a total of 0 rules in 250 ms. Remains 133 /133 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:07:16] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:07:16] [INFO ] Invariant cache hit.
[2024-05-21 11:07:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:07:44] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60671 ms. Remains : 133/133 places, 2346/2346 transitions.
RANDOM walk for 40000 steps (92 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (32 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 309933 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 309933 steps, saw 82753 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 11:08:19] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:08:19] [INFO ] Invariant cache hit.
[2024-05-21 11:08:19] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 339 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2346/2346 transitions.
Applied a total of 0 rules in 213 ms. Remains 133 /133 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 133/133 places, 2346/2346 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2346/2346 transitions.
Applied a total of 0 rules in 204 ms. Remains 133 /133 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2024-05-21 11:08:21] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:08:21] [INFO ] Invariant cache hit.
[2024-05-21 11:08:21] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-21 11:08:21] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:08:21] [INFO ] Invariant cache hit.
[2024-05-21 11:08:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:08:22] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2024-05-21 11:08:22] [INFO ] Redundant transitions in 50 ms returned []
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:08:22] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:08:22] [INFO ] Invariant cache hit.
[2024-05-21 11:08:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:08:51] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 0 ms to minimize.
[2024-05-21 11:09:08] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
Problem TDEAD1267 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1540 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 14 solved, 2329 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 14 solved, 2329 unsolved
Problem TDEAD1561 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2254 is UNSAT
Problem TDEAD2275 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 49 solved, 2294 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 133/422 variables, and 7 constraints, problems are : Problem set: 49 solved, 2294 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 81375ms problems are : Problem set: 49 solved, 2294 unsolved
Search for dead transitions found 49 dead transitions in 81400ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/133 places, 2297/2346 transitions.
Applied a total of 0 rules in 248 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 11:09:44] [INFO ] Redundant transitions in 88 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83239 ms. Remains : 133/133 places, 2297/2346 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2346/2346 transitions.
Applied a total of 0 rules in 464 ms. Remains 133 /133 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:09:45] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:09:45] [INFO ] Invariant cache hit.
[2024-05-21 11:09:45] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:10:13] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 59903ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 59936ms
[2024-05-21 11:10:45] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:10:45] [INFO ] Invariant cache hit.
[2024-05-21 11:10:45] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-21 11:10:45] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:10:45] [INFO ] Invariant cache hit.
[2024-05-21 11:10:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:10:46] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2024-05-21 11:10:46] [INFO ] Redundant transitions in 65 ms returned []
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:10:46] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:10:46] [INFO ] Invariant cache hit.
[2024-05-21 11:10:46] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:11:16] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2024-05-21 11:11:34] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
Problem TDEAD1267 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1603 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 17 solved, 2326 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 17 solved, 2326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 17 solved, 2326 unsolved
Problem TDEAD1624 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2254 is UNSAT
Problem TDEAD2275 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 49 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 49 solved, 2294 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 82084ms problems are : Problem set: 49 solved, 2294 unsolved
Search for dead transitions found 49 dead transitions in 82111ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2297/2346 transitions.
Applied a total of 0 rules in 197 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 11:12:08] [INFO ] Redundant transitions in 46 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 144023 ms. Remains : 133/133 places, 2297/2346 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (92 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (32 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274533 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274533 steps, saw 73454 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-21 11:12:12] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 11:12:12] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:12:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/396 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/398 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/421 variables, 23/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/396 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/398 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/421 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 239 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 273 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 11:12:13] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:12:13] [INFO ] Invariant cache hit.
[2024-05-21 11:12:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 11:12:40] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
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 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 58924ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 58953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59233 ms. Remains : 133/133 places, 2297/2297 transitions.
RANDOM walk for 40000 steps (92 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (32 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280438 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 280438 steps, saw 75015 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-21 11:13:15] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:13:15] [INFO ] Invariant cache hit.
[2024-05-21 11:13:15] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/396 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/398 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/421 variables, 23/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/421 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/396 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/398 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/421 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 193 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 172 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 133/133 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 177 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 11:13:16] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:13:16] [INFO ] Invariant cache hit.
[2024-05-21 11:13:16] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 11:13:16] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:13:16] [INFO ] Invariant cache hit.
[2024-05-21 11:13:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:13:17] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2024-05-21 11:13:17] [INFO ] Redundant transitions in 45 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 11:13:17] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:13:17] [INFO ] Invariant cache hit.
[2024-05-21 11:13:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 11:13:43] [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 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 78003ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 78027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79130 ms. Remains : 133/133 places, 2297/2297 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 241 reset in 819 ms.
Product exploration explored 100000 steps with 241 reset in 569 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 165 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 11:14:37] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:14:37] [INFO ] Invariant cache hit.
[2024-05-21 11:14:37] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 11:15:06] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
[2024-05-21 11:15:37] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:15:37] [INFO ] Invariant cache hit.
[2024-05-21 11:15:38] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-21 11:15:38] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:15:38] [INFO ] Invariant cache hit.
[2024-05-21 11:15:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:15:38] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2024-05-21 11:15:39] [INFO ] Redundant transitions in 74 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 11:15:39] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 11:15:39] [INFO ] Invariant cache hit.
[2024-05-21 11:15:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 11:16:06] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 79124ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 79149ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 140856 ms. Remains : 133/133 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 finished in 648981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2347
Applied a total of 1 rules in 10 ms. Remains 137 /138 variables (removed 1) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:16:58] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-21 11:16:58] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 11:16:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:17:29] [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 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 62451ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 62473ms
[2024-05-21 11:18:00] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:18:00] [INFO ] Invariant cache hit.
[2024-05-21 11:18:01] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 11:18:01] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:18:01] [INFO ] Invariant cache hit.
[2024-05-21 11:18:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:18:02] [INFO ] Implicit Places using invariants and state equation in 949 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1327 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63828 ms. Remains : 135/138 places, 2347/2347 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 141 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 finished in 63957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2347
Applied a total of 2 rules in 9 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:18:02] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 11:18:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 11:18:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:18:34] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 61335ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 61359ms
[2024-05-21 11:19:03] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:19:03] [INFO ] Invariant cache hit.
[2024-05-21 11:19:03] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-21 11:19:03] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:19:03] [INFO ] Invariant cache hit.
[2024-05-21 11:19:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:19:05] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1665 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63059 ms. Remains : 134/138 places, 2347/2347 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 finished in 63157 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))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Graph (complete) has 3849 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2346
Applied a total of 3 rules in 234 ms. Remains 135 /138 variables (removed 3) and now considering 2346/2347 (removed 1) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:19:05] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 11:19:05] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:19:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:19:33] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 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 Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 58792ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 58817ms
[2024-05-21 11:20:04] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:20:04] [INFO ] Invariant cache hit.
[2024-05-21 11:20:04] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 11:20:04] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:20:04] [INFO ] Invariant cache hit.
[2024-05-21 11:20:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:20:05] [INFO ] Implicit Places using invariants and state equation in 925 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2346/2347 transitions.
Applied a total of 0 rules in 181 ms. Remains 134 /134 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60464 ms. Remains : 134/138 places, 2346/2347 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 finished in 60540 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(F(p0)) U G(p1))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2346
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2346
Applied a total of 4 rules in 36 ms. Remains 135 /138 variables (removed 3) and now considering 2346/2347 (removed 1) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:20:06] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 11:20:06] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 11:20:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:20:34] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 1/1 constraints]
After SMT, in 58966ms problems are : Problem set: 0 solved, 2343 unsolved
Search for dead transitions found 0 dead transitions in 58993ms
[2024-05-21 11:21:05] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:21:05] [INFO ] Invariant cache hit.
[2024-05-21 11:21:05] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-21 11:21:05] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:21:05] [INFO ] Invariant cache hit.
[2024-05-21 11:21:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:21:06] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1657 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2346/2347 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60705 ms. Remains : 133/138 places, 2346/2347 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
Stuttering criterion allowed to conclude after 735 steps with 2 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 finished in 60840 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))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Graph (complete) has 3849 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2346
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2346
Applied a total of 3 rules in 204 ms. Remains 135 /138 variables (removed 3) and now considering 2346/2347 (removed 1) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 11:21:07] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
[2024-05-21 11:21:07] [INFO ] Invariant cache hit.
[2024-05-21 11:21:07] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:21:34] [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 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 11:22:06] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
Problem TDEAD1267 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1351 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 1)
(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 1)
(s53 0)
(s54 50)
(s55 0)
(s56 1)
(s57 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 7 constraints, problems are : Problem set: 5 solved, 2338 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 59959ms problems are : Problem set: 5 solved, 2338 unsolved
Search for dead transitions found 5 dead transitions in 59983ms
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-05-21 11:22:07] [INFO ] Flow matrix only has 289 transitions (discarded 2052 similar events)
[2024-05-21 11:22:07] [INFO ] Invariant cache hit.
[2024-05-21 11:22:07] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-21 11:22:07] [INFO ] Flow matrix only has 289 transitions (discarded 2052 similar events)
[2024-05-21 11:22:07] [INFO ] Invariant cache hit.
[2024-05-21 11:22:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:22:08] [INFO ] Implicit Places using invariants and state equation in 824 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1225 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2341/2347 transitions.
Applied a total of 0 rules in 179 ms. Remains 134 /134 variables (removed 0) and now considering 2341/2341 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61600 ms. Remains : 134/138 places, 2341/2347 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
Product exploration explored 100000 steps with 14042 reset in 756 ms.
Product exploration explored 100000 steps with 13860 reset in 756 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 93 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 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 99 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2024-05-21 11:22:10] [INFO ] Flow matrix only has 289 transitions (discarded 2052 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 11:22:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 11:22:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 finished in 64182 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 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Graph (complete) has 3849 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 185 ms. Remains 137 /138 variables (removed 1) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:22:11] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-21 11:22:11] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 11:22:11] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:22:41] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
[2024-05-21 11:23:11] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:23:11] [INFO ] Invariant cache hit.
[2024-05-21 11:23:11] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-21 11:23:11] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:23:11] [INFO ] Invariant cache hit.
[2024-05-21 11:23:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:23:12] [INFO ] Implicit Places using invariants and state equation in 939 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1330 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 211 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62126 ms. Remains : 135/138 places, 2347/2347 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14
Product exploration explored 100000 steps with 1259 reset in 540 ms.
Product exploration explored 100000 steps with 1284 reset in 755 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3640 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2347 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 135 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 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 523 steps (0 resets) in 11 ms. (43 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 210 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 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 11:23:15] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 135 cols
[2024-05-21 11:23:15] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 11:23:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:23:16] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-21 11:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:23:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:23:17] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-21 11:23:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:23:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 558 ms returned sat
[2024-05-21 11:23:18] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 144 ms.
[2024-05-21 11:23:18] [INFO ] Added : 37 causal constraints over 8 iterations in 410 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 215 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:23:18] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:23:18] [INFO ] Invariant cache hit.
[2024-05-21 11:23:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:23:43] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 57443ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 57469ms
[2024-05-21 11:24:16] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:24:16] [INFO ] Invariant cache hit.
[2024-05-21 11:24:16] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-21 11:24:16] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:24:16] [INFO ] Invariant cache hit.
[2024-05-21 11:24:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:24:17] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2024-05-21 11:24:17] [INFO ] Redundant transitions in 50 ms returned []
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:24:17] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:24:17] [INFO ] Invariant cache hit.
[2024-05-21 11:24:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:24:47] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:25:36] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
Problem TDEAD1268 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1331 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/425 variables, and 7 constraints, problems are : Problem set: 4 solved, 2340 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 2/2 constraints]
After SMT, in 80080ms problems are : Problem set: 4 solved, 2340 unsolved
Search for dead transitions found 4 dead transitions in 80109ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/135 places, 2343/2347 transitions.
Applied a total of 0 rules in 183 ms. Remains 135 /135 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
[2024-05-21 11:25:37] [INFO ] Redundant transitions in 100 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 139611 ms. Remains : 135/135 places, 2343/2347 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3636 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2343 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 185 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 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 537 steps (0 resets) in 12 ms. (41 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 190 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 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 11:25:38] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 11:25:38] [INFO ] Invariant cache hit.
[2024-05-21 11:25:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:25:39] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-21 11:25:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:25:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:25:40] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 11:25:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:25:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 98 ms returned sat
[2024-05-21 11:25:41] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 173 ms.
[2024-05-21 11:25:41] [INFO ] Added : 38 causal constraints over 8 iterations in 403 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1280 reset in 660 ms.
Product exploration explored 100000 steps with 1260 reset in 511 ms.
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2343/2343 transitions.
Applied a total of 0 rules in 179 ms. Remains 135 /135 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
Running 2340 sub problems to find dead transitions.
[2024-05-21 11:25:42] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 11:25:42] [INFO ] Invariant cache hit.
[2024-05-21 11:25:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 11:26:11] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2340 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2340/2340 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2340 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2340 constraints, Known Traps: 1/1 constraints]
After SMT, in 60688ms problems are : Problem set: 0 solved, 2340 unsolved
Search for dead transitions found 0 dead transitions in 60708ms
[2024-05-21 11:26:43] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 11:26:43] [INFO ] Invariant cache hit.
[2024-05-21 11:26:43] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-21 11:26:43] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 11:26:43] [INFO ] Invariant cache hit.
[2024-05-21 11:26:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:26:44] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
[2024-05-21 11:26:44] [INFO ] Redundant transitions in 70 ms returned []
Running 2340 sub problems to find dead transitions.
[2024-05-21 11:26:44] [INFO ] Flow matrix only has 290 transitions (discarded 2053 similar events)
[2024-05-21 11:26:44] [INFO ] Invariant cache hit.
[2024-05-21 11:26:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 11:27:11] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2340 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2340/2340 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2340 unsolved
[2024-05-21 11:27:58] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 1 ms to minimize.
Problem TDEAD1348 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1705 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/425 variables, and 7 constraints, problems are : Problem set: 18 solved, 2322 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2340 constraints, Known Traps: 2/2 constraints]
After SMT, in 78788ms problems are : Problem set: 18 solved, 2322 unsolved
Search for dead transitions found 18 dead transitions in 78814ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/135 places, 2325/2343 transitions.
Applied a total of 0 rules in 221 ms. Remains 135 /135 variables (removed 0) and now considering 2325/2325 (removed 0) transitions.
[2024-05-21 11:28:03] [INFO ] Redundant transitions in 101 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 141284 ms. Remains : 135/135 places, 2325/2343 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14 finished in 353081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Graph (complete) has 3849 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 38 ms. Remains 137 /138 variables (removed 1) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:28:04] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-21 11:28:04] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 11:28:04] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:28:33] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 60728ms
[2024-05-21 11:29:05] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:29:05] [INFO ] Invariant cache hit.
[2024-05-21 11:29:05] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-21 11:29:05] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:29:05] [INFO ] Invariant cache hit.
[2024-05-21 11:29:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:29:06] [INFO ] Implicit Places using invariants and state equation in 969 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1372 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 136/138 places, 2347/2347 transitions.
Applied a total of 0 rules in 48 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 62194 ms. Remains : 136/138 places, 2347/2347 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
Product exploration explored 100000 steps with 254 reset in 785 ms.
Product exploration explored 100000 steps with 254 reset in 634 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3744 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1677 steps (0 resets) in 33 ms. (49 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:29:09] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 11:29:09] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 11:29:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:29:38] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 1/1 constraints]
After SMT, in 60976ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 61005ms
[2024-05-21 11:30:10] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:30:10] [INFO ] Invariant cache hit.
[2024-05-21 11:30:10] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-21 11:30:10] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:30:10] [INFO ] Invariant cache hit.
[2024-05-21 11:30:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:30:11] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 2344 sub problems to find dead transitions.
[2024-05-21 11:30:11] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-05-21 11:30:11] [INFO ] Invariant cache hit.
[2024-05-21 11:30:11] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-05-21 11:30:39] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2024-05-21 11:30:56] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 1 ms to minimize.
Problem TDEAD1268 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1583 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/426 variables, and 7 constraints, problems are : Problem set: 16 solved, 2328 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 16 solved, 2328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 16 solved, 2328 unsolved
Problem TDEAD1604 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2255 is UNSAT
Problem TDEAD2276 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 49 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/426 variables, and 7 constraints, problems are : Problem set: 49 solved, 2295 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 2/2 constraints]
After SMT, in 79165ms problems are : Problem set: 49 solved, 2295 unsolved
Search for dead transitions found 49 dead transitions in 79194ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/136 places, 2298/2347 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141560 ms. Remains : 136/136 places, 2298/2347 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3693 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1683 steps (0 resets) in 23 ms. (70 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 248 reset in 875 ms.
Product exploration explored 100000 steps with 251 reset in 659 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 11:31:34] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 11:31:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 11:31:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 11:32:00] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20126 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 58554ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 58583ms
[2024-05-21 11:32:32] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 11:32:32] [INFO ] Invariant cache hit.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 2348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.073s, Sys 0.034s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2165
MODEL NAME: /home/mcc/execution/model
138 places, 2348 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-V50P50N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V50P50N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397800259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;