Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.1M
-rw-r--r-- 1 mcc users 17K Apr 13 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 298K Apr 13 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 13 01:00 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 14K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 399K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Apr 13 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K Apr 13 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 596K Apr 13 01:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 01:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717222302266

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:11:44] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-06-01 06:11:44] [INFO ] Transformed 188 places.
[2024-06-01 06:11:44] [INFO ] Transformed 2108 transitions.
[2024-06-01 06:11:44] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 85 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (56 resets) in 2270 ms. (17 steps per ms) remains 11/16 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (20 resets) in 13969 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (24 resets) in 4133 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (24 resets) in 2196 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (20 resets) in 306 ms. (130 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 393 ms. (101 steps per ms) remains 10/11 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (20 resets) in 473 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 522 ms. (76 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 1638 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (20 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 388 ms. (102 steps per ms) remains 10/10 properties
[2024-06-01 06:11:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-06-01 06:11:51] [INFO ] Computed 7 invariants in 30 ms
[2024-06-01 06:11:51] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/188 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 5 solved, 5 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 121/188 variables, 6/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 18 ms to minimize.
[2024-06-01 06:12:04] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 3 ms to minimize.
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/197 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 22/219 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 4/223 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 223 constraints, problems are : Problem set: 6 solved, 4 unsolved in 3928 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 16364ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 5146 ms.
Support contains 48 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 304 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2024-06-01 06:12:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-06-01 06:12:13] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 06:12:13] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 06:12:36] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 1/1 constraints]
After SMT, in 53221ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 53245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53589 ms. Remains : 185/188 places, 2107/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 514 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (20 resets) in 385 ms. (103 steps per ms) remains 3/4 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
[2024-06-01 06:13:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-06-01 06:13:07] [INFO ] Invariant cache hit.
[2024-06-01 06:13:07] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 368/547 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 22/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/554 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/554 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 368/547 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 22/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/554 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/554 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 215 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1744 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2674ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3260 ms.
Support contains 18 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 183 transition count 2106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 182 transition count 2105
Applied a total of 5 rules in 505 ms. Remains 182 /185 variables (removed 3) and now considering 2105/2107 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 505 ms. Remains : 182/185 places, 2105/2107 transitions.
RANDOM walk for 40000 steps (76 resets) in 569 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (37 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (39 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 218284 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 218284 steps, saw 74288 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
[2024-06-01 06:13:17] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 182 cols
[2024-06-01 06:13:17] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 06:13:17] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/549 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/549 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/549 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/549 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 211 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2450 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3022ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1801 ms.
Support contains 18 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 2105/2105 transitions.
Applied a total of 0 rules in 200 ms. Remains 182 /182 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 182/182 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 2105/2105 transitions.
Applied a total of 0 rules in 182 ms. Remains 182 /182 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2024-06-01 06:13:22] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-06-01 06:13:22] [INFO ] Invariant cache hit.
[2024-06-01 06:13:22] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 06:13:22] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-06-01 06:13:22] [INFO ] Invariant cache hit.
[2024-06-01 06:13:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:13:24] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1579 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 180/182 places, 2105/2105 transitions.
Applied a total of 0 rules in 230 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1993 ms. Remains : 180/182 places, 2105/2105 transitions.
RANDOM walk for 40000 steps (76 resets) in 510 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (36 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (39 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (40 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 236784 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 3
Probabilistic random walk after 236784 steps, saw 80707 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 06:13:27] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 180 cols
[2024-06-01 06:13:27] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:13:27] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/547 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/547 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/547 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2885 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3416ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1344 ms.
Support contains 18 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2105/2105 transitions.
Applied a total of 0 rules in 138 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 180/180 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2105/2105 transitions.
Applied a total of 0 rules in 139 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2024-06-01 06:13:32] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-06-01 06:13:32] [INFO ] Invariant cache hit.
[2024-06-01 06:13:32] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 06:13:32] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-06-01 06:13:32] [INFO ] Invariant cache hit.
[2024-06-01 06:13:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:13:34] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2024-06-01 06:13:34] [INFO ] Redundant transitions in 148 ms returned []
Running 2102 sub problems to find dead transitions.
[2024-06-01 06:13:34] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-06-01 06:13:34] [INFO ] Invariant cache hit.
[2024-06-01 06:13:34] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2024-06-01 06:14:14] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 0 ms to minimize.
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/547 variables, and 6 constraints, problems are : Problem set: 80 solved, 2022 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2022 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 2022 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 2/6 constraints. Problems are: Problem set: 80 solved, 2022 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/6 constraints. Problems are: Problem set: 80 solved, 2022 unsolved
SMT process timed out in 73691ms, After SMT, problems are : Problem set: 80 solved, 2022 unsolved
Search for dead transitions found 80 dead transitions in 73714ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 180/180 places, 2025/2105 transitions.
Applied a total of 0 rules in 186 ms. Remains 180 /180 variables (removed 0) and now considering 2025/2025 (removed 0) transitions.
[2024-06-01 06:14:48] [INFO ] Redundant transitions in 118 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76243 ms. Remains : 180/180 places, 2025/2105 transitions.
RANDOM walk for 40000 steps (76 resets) in 503 ms. (79 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (36 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (39 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 215597 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 3
Probabilistic random walk after 215597 steps, saw 73574 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 06:14:52] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
// Phase 1: matrix 366 rows 180 cols
[2024-06-01 06:14:52] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 06:14:52] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/546 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/546 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2467 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3001ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1030 ms.
Support contains 18 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2025/2025 transitions.
Applied a total of 0 rules in 170 ms. Remains 180 /180 variables (removed 0) and now considering 2025/2025 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 180/180 places, 2025/2025 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2025/2025 transitions.
Applied a total of 0 rules in 146 ms. Remains 180 /180 variables (removed 0) and now considering 2025/2025 (removed 0) transitions.
[2024-06-01 06:14:56] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-06-01 06:14:56] [INFO ] Invariant cache hit.
[2024-06-01 06:14:56] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 06:14:56] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-06-01 06:14:56] [INFO ] Invariant cache hit.
[2024-06-01 06:14:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:14:58] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
[2024-06-01 06:14:58] [INFO ] Redundant transitions in 78 ms returned []
Running 2022 sub problems to find dead transitions.
[2024-06-01 06:14:59] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-06-01 06:14:59] [INFO ] Invariant cache hit.
[2024-06-01 06:14:59] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2022 unsolved
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 2 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 180/546 variables, and 5 constraints, problems are : Problem set: 0 solved, 2022 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2022/2022 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2022 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2022 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2022 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2022 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 3 (OVERLAPS) 366/546 variables, 180/185 constraints. Problems are: Problem set: 2 solved, 2020 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 21/206 constraints. Problems are: Problem set: 2 solved, 2020 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 2226 constraints, problems are : Problem set: 2 solved, 2020 unsolved in 33781 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2020/2022 constraints, Known Traps: 1/1 constraints]
After SMT, in 78879ms problems are : Problem set: 2 solved, 2020 unsolved
Search for dead transitions found 2 dead transitions in 78911ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 180/180 places, 2023/2025 transitions.
Applied a total of 0 rules in 120 ms. Remains 180 /180 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
[2024-06-01 06:16:18] [INFO ] Redundant transitions in 30 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81723 ms. Remains : 180/180 places, 2023/2025 transitions.
RANDOM walk for 40000 steps (76 resets) in 527 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (36 resets) in 505 ms. (79 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 361 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (39 resets) in 484 ms. (82 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 203865 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 203865 steps, saw 69632 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 06:16:21] [INFO ] Flow matrix only has 364 transitions (discarded 1659 similar events)
// Phase 1: matrix 364 rows 180 cols
[2024-06-01 06:16:21] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:16:21] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/544 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/544 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2826 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3548ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2237 ms.
Support contains 18 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2023/2023 transitions.
Applied a total of 0 rules in 152 ms. Remains 180 /180 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 180/180 places, 2023/2023 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2023/2023 transitions.
Applied a total of 0 rules in 151 ms. Remains 180 /180 variables (removed 0) and now considering 2023/2023 (removed 0) transitions.
[2024-06-01 06:16:27] [INFO ] Flow matrix only has 364 transitions (discarded 1659 similar events)
[2024-06-01 06:16:27] [INFO ] Invariant cache hit.
[2024-06-01 06:16:28] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 06:16:28] [INFO ] Flow matrix only has 364 transitions (discarded 1659 similar events)
[2024-06-01 06:16:28] [INFO ] Invariant cache hit.
[2024-06-01 06:16:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 06:16:28] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-06-01 06:16:28] [INFO ] Redundant transitions in 62 ms returned []
Running 2020 sub problems to find dead transitions.
[2024-06-01 06:16:28] [INFO ] Flow matrix only has 364 transitions (discarded 1659 similar events)
[2024-06-01 06:16:28] [INFO ] Invariant cache hit.
[2024-06-01 06:16:28] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
[2024-06-01 06:16:49] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 2 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1051 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/544 variables, and 6 constraints, problems are : Problem set: 80 solved, 1940 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 1940 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 2/6 constraints. Problems are: Problem set: 80 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 180/544 variables, and 6 constraints, problems are : Problem set: 80 solved, 1940 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 2/2 constraints]
After SMT, in 72407ms problems are : Problem set: 80 solved, 1940 unsolved
Search for dead transitions found 80 dead transitions in 72431ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 180/180 places, 1943/2023 transitions.
Applied a total of 0 rules in 131 ms. Remains 180 /180 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
[2024-06-01 06:17:41] [INFO ] Redundant transitions in 31 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 73798 ms. Remains : 180/180 places, 1943/2023 transitions.
RANDOM walk for 40000 steps (76 resets) in 637 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (36 resets) in 390 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (38 resets) in 400 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 570 ms. (70 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 202117 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 202117 steps, saw 69054 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 06:17:45] [INFO ] Flow matrix only has 363 transitions (discarded 1580 similar events)
// Phase 1: matrix 363 rows 180 cols
[2024-06-01 06:17:45] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 06:17:45] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 363/541 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/543 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 204 constraints, problems are : Problem set: 0 solved, 3 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 363/541 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/543 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/543 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2756 ms.
Support contains 18 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 1943/1943 transitions.
Applied a total of 0 rules in 119 ms. Remains 180 /180 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 180/180 places, 1943/1943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 1943/1943 transitions.
Applied a total of 0 rules in 113 ms. Remains 180 /180 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
[2024-06-01 06:17:50] [INFO ] Flow matrix only has 363 transitions (discarded 1580 similar events)
[2024-06-01 06:17:50] [INFO ] Invariant cache hit.
[2024-06-01 06:17:50] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 06:17:50] [INFO ] Flow matrix only has 363 transitions (discarded 1580 similar events)
[2024-06-01 06:17:50] [INFO ] Invariant cache hit.
[2024-06-01 06:17:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 06:17:51] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2024-06-01 06:17:51] [INFO ] Redundant transitions in 46 ms returned []
Running 1940 sub problems to find dead transitions.
[2024-06-01 06:17:51] [INFO ] Flow matrix only has 363 transitions (discarded 1580 similar events)
[2024-06-01 06:17:51] [INFO ] Invariant cache hit.
[2024-06-01 06:17:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/543 variables, and 5 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1940 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 180/543 variables, and 5 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 1/1 constraints]
After SMT, in 71234ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 71259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72203 ms. Remains : 180/180 places, 1943/1943 transitions.
[2024-06-01 06:19:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 06:19:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 180 places, 1943 transitions and 14010 arcs took 33 ms.
[2024-06-01 06:19:03] [INFO ] Flatten gal took : 425 ms
Total runtime 440105 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-14

BK_STOP 1717222749269

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/701/inv_0_
rfs formula name BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/701/inv_1_
rfs formula name BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/701/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-V80P50N10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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