About the Execution of LTSMin+red for BridgeAndVehicles-PT-V80P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15839.140 | 659014.00 | 988732.00 | 132.90 | ??FTF???F?TFT??? | normal |
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-171620399200273.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V80P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399200273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717221669277
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:01:10] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-06-01 06:01:10] [INFO ] Transformed 188 places.
[2024-06-01 06:01:10] [INFO ] Transformed 2108 transitions.
[2024-06-01 06:01:10] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 65 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-06-01 06:01:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2024-06-01 06:01:11] [INFO ] Computed 6 invariants in 25 ms
[2024-06-01 06:01:11] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:01:35] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/557 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 06:02:04] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 2 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/557 variables, and 7 constraints, problems are : Problem set: 2 solved, 2103 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 53895ms problems are : Problem set: 2 solved, 2103 unsolved
Search for dead transitions found 2 dead transitions in 53959ms
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-06-01 06:02:05] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
// Phase 1: matrix 370 rows 187 cols
[2024-06-01 06:02:05] [INFO ] Computed 6 invariants in 14 ms
[2024-06-01 06:02:05] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 06:02:05] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:02:05] [INFO ] Invariant cache hit.
[2024-06-01 06:02:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:02:05] [INFO ] Implicit Places using invariants and state equation in 607 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 892 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2106/2108 transitions.
Applied a total of 0 rules in 17 ms. Remains 186 /186 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54994 ms. Remains : 186/188 places, 2106/2108 transitions.
Support contains 76 out of 186 places after structural reductions.
[2024-06-01 06:02:06] [INFO ] Flatten gal took : 168 ms
[2024-06-01 06:02:06] [INFO ] Flatten gal took : 121 ms
[2024-06-01 06:02:06] [INFO ] Input system was already deterministic with 2106 transitions.
RANDOM walk for 40000 steps (56 resets) in 2466 ms. (16 steps per ms) remains 41/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
[2024-06-01 06:02:08] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:02:08] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 06:02:08] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 125/174 variables, 3/5 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 370/544 variables, 174/179 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 22/201 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/201 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 12/556 variables, 12/213 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 1/214 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/214 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/214 constraints. Problems are: Problem set: 37 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 214 constraints, problems are : Problem set: 37 solved, 4 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 161/168 variables, 3/4 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 324/492 variables, 168/172 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/172 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 51/543 variables, 5/177 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 22/199 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 4/203 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/545 variables, 1/204 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 2/206 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/206 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/556 variables, 11/217 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/556 variables, 1/218 constraints. Problems are: Problem set: 37 solved, 4 unsolved
[2024-06-01 06:02:11] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/556 variables, 1/219 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 37 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/556 variables, 0/219 constraints. Problems are: Problem set: 37 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 219 constraints, problems are : Problem set: 37 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 5451ms problems are : Problem set: 37 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 701 ms.
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Graph (complete) has 1717 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 377 ms. Remains 185 /186 variables (removed 1) and now considering 2106/2106 (removed 0) transitions.
Running 2103 sub problems to find dead transitions.
[2024-06-01 06:02:14] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
// Phase 1: matrix 370 rows 185 cols
[2024-06-01 06:02:14] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:02:14] [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, 2103 unsolved
[2024-06-01 06:02:38] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2103/2103 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2103 constraints, Known Traps: 1/1 constraints]
After SMT, in 53228ms problems are : Problem set: 0 solved, 2103 unsolved
Search for dead transitions found 0 dead transitions in 53252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53637 ms. Remains : 185/186 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (56 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 199808 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 199808 steps, saw 55646 distinct states, run finished after 3010 ms. (steps per millisecond=66 ) properties seen :0
[2024-06-01 06:03:11] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:03:11] [INFO ] Invariant cache hit.
[2024-06-01 06:03:11] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 80/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 243/327 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 214/541 variables, 87/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 22/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/543 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/555 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 321 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/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 80/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 243/327 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 214/541 variables, 87/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 22/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/543 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/555 variables, 12/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/555 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/555 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 215 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1734 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 2079ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 446 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2106/2106 transitions.
Applied a total of 0 rules in 188 ms. Remains 185 /185 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 185/185 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2106/2106 transitions.
Applied a total of 0 rules in 267 ms. Remains 185 /185 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-06-01 06:03:14] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:03:14] [INFO ] Invariant cache hit.
[2024-06-01 06:03:14] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-06-01 06:03:14] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:03:14] [INFO ] Invariant cache hit.
[2024-06-01 06:03:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:03:15] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1406 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/185 places, 2106/2106 transitions.
Applied a total of 0 rules in 173 ms. Remains 184 /184 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1848 ms. Remains : 184/185 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (56 resets) in 519 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40006 steps (20 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40009 steps (20 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 310560 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 3
Probabilistic random walk after 310560 steps, saw 85444 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
[2024-06-01 06:03:19] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
// Phase 1: matrix 370 rows 184 cols
[2024-06-01 06:03:19] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:03:19] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 80/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 243/327 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 213/540 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/554 variables, 12/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 3 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 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/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 80/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 243/327 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 213/540 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/542 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/554 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/554 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 214 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1894ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 397 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2106/2106 transitions.
Applied a total of 0 rules in 187 ms. Remains 184 /184 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 184/184 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2106/2106 transitions.
Applied a total of 0 rules in 192 ms. Remains 184 /184 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-06-01 06:03:21] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:03:21] [INFO ] Invariant cache hit.
[2024-06-01 06:03:22] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 06:03:22] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:03:22] [INFO ] Invariant cache hit.
[2024-06-01 06:03:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 06:03:24] [INFO ] Implicit Places using invariants and state equation in 2216 ms returned []
Implicit Place search using SMT with State Equation took 2632 ms to find 0 implicit places.
[2024-06-01 06:03:24] [INFO ] Redundant transitions in 134 ms returned []
Running 2103 sub problems to find dead transitions.
[2024-06-01 06:03:24] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:03:24] [INFO ] Invariant cache hit.
[2024-06-01 06:03:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
[2024-06-01 06:03:49] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:04:04] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 1 ms to minimize.
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1553 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 7 constraints, problems are : Problem set: 36 solved, 2067 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2103/2103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 36 solved, 2067 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 36 solved, 2067 unsolved
Problem TDEAD1564 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2015 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 78 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 78 solved, 2025 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2103 constraints, Known Traps: 2/2 constraints]
After SMT, in 74452ms problems are : Problem set: 78 solved, 2025 unsolved
Search for dead transitions found 78 dead transitions in 74474ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 2028/2106 transitions.
Applied a total of 0 rules in 186 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-06-01 06:04:39] [INFO ] Redundant transitions in 112 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77752 ms. Remains : 184/184 places, 2028/2106 transitions.
Successfully simplified 37 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:04:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:04:39] [INFO ] Flatten gal took : 99 ms
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:04:39] [INFO ] Flatten gal took : 103 ms
[2024-06-01 06:04:39] [INFO ] Input system was already deterministic with 2106 transitions.
Support contains 33 out of 186 places (down from 37) after GAL structural reductions.
FORMULA BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 4143 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.38 ms
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 184 transition count 2105
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 2105
Applied a total of 3 rules in 43 ms. Remains 184 /186 variables (removed 2) and now considering 2105/2106 (removed 1) transitions.
Running 2102 sub problems to find dead transitions.
[2024-06-01 06:04:40] [INFO ] Flow matrix only has 369 transitions (discarded 1736 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 06:04:40] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 06:04:40] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-06-01 06:05:05] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 20)
(s85 0)
(s86 1)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 1/1 constraints]
After SMT, in 55416ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 55434ms
Finished structural reductions in LTL mode , in 1 iterations and 55483 ms. Remains : 184/186 places, 2105/2106 transitions.
[2024-06-01 06:05:35] [INFO ] Flatten gal took : 74 ms
[2024-06-01 06:05:35] [INFO ] Flatten gal took : 72 ms
[2024-06-01 06:05:35] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Graph (complete) has 4143 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 184 transition count 2105
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 184 transition count 2105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 182 transition count 2104
Applied a total of 6 rules in 680 ms. Remains 182 /186 variables (removed 4) and now considering 2104/2106 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 681 ms. Remains : 182/186 places, 2104/2106 transitions.
[2024-06-01 06:05:36] [INFO ] Flatten gal took : 54 ms
[2024-06-01 06:05:36] [INFO ] Flatten gal took : 61 ms
[2024-06-01 06:05:36] [INFO ] Input system was already deterministic with 2104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Running 2103 sub problems to find dead transitions.
[2024-06-01 06:05:36] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-06-01 06:05:36] [INFO ] Computed 6 invariants in 8 ms
[2024-06-01 06:05:36] [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, 2103 unsolved
[2024-06-01 06:06:01] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2103/2103 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
[2024-06-01 06:06:30] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1377 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/556 variables, and 7 constraints, problems are : Problem set: 20 solved, 2083 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2103 constraints, Known Traps: 2/2 constraints]
After SMT, in 55422ms problems are : Problem set: 20 solved, 2083 unsolved
Search for dead transitions found 20 dead transitions in 55450ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/186 places, 2086/2106 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 2086/2086 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55483 ms. Remains : 186/186 places, 2086/2106 transitions.
[2024-06-01 06:06:32] [INFO ] Flatten gal took : 47 ms
[2024-06-01 06:06:32] [INFO ] Flatten gal took : 56 ms
[2024-06-01 06:06:32] [INFO ] Input system was already deterministic with 2086 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Running 2103 sub problems to find dead transitions.
[2024-06-01 06:06:32] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:06:32] [INFO ] Invariant cache hit.
[2024-06-01 06:06:32] [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, 2103 unsolved
[2024-06-01 06:06:57] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2103/2103 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2103 constraints, Known Traps: 1/1 constraints]
After SMT, in 53964ms problems are : Problem set: 0 solved, 2103 unsolved
Search for dead transitions found 0 dead transitions in 53983ms
Finished structural reductions in LTL mode , in 1 iterations and 54000 ms. Remains : 186/186 places, 2106/2106 transitions.
[2024-06-01 06:07:26] [INFO ] Flatten gal took : 70 ms
[2024-06-01 06:07:26] [INFO ] Flatten gal took : 73 ms
[2024-06-01 06:07:26] [INFO ] Input system was already deterministic with 2106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Applied a total of 0 rules in 11 ms. Remains 186 /186 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Running 2103 sub problems to find dead transitions.
[2024-06-01 06:07:26] [INFO ] Flow matrix only has 370 transitions (discarded 1736 similar events)
[2024-06-01 06:07:26] [INFO ] Invariant cache hit.
[2024-06-01 06:07:26] [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, 2103 unsolved
[2024-06-01 06:07:51] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2103/2103 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2103 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2103 constraints, Known Traps: 1/1 constraints]
After SMT, in 54405ms problems are : Problem set: 0 solved, 2103 unsolved
Search for dead transitions found 0 dead transitions in 54427ms
Finished structural reductions in LTL mode , in 1 iterations and 54445 ms. Remains : 186/186 places, 2106/2106 transitions.
[2024-06-01 06:08:21] [INFO ] Flatten gal took : 56 ms
[2024-06-01 06:08:21] [INFO ] Flatten gal took : 57 ms
[2024-06-01 06:08:21] [INFO ] Input system was already deterministic with 2106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 184 transition count 2105
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 2105
Applied a total of 3 rules in 25 ms. Remains 184 /186 variables (removed 2) and now considering 2105/2106 (removed 1) transitions.
Running 2102 sub problems to find dead transitions.
[2024-06-01 06:08:21] [INFO ] Flow matrix only has 369 transitions (discarded 1736 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-06-01 06:08:21] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 06:08:21] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-06-01 06:08:45] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 1/1 constraints]
After SMT, in 54049ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 54077ms
Finished structural reductions in LTL mode , in 1 iterations and 54109 ms. Remains : 184/186 places, 2105/2106 transitions.
[2024-06-01 06:09:15] [INFO ] Flatten gal took : 45 ms
[2024-06-01 06:09:15] [INFO ] Flatten gal took : 52 ms
[2024-06-01 06:09:15] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 184 transition count 2105
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 2105
Applied a total of 3 rules in 29 ms. Remains 184 /186 variables (removed 2) and now considering 2105/2106 (removed 1) transitions.
Running 2102 sub problems to find dead transitions.
[2024-06-01 06:09:16] [INFO ] Flow matrix only has 369 transitions (discarded 1736 similar events)
[2024-06-01 06:09:16] [INFO ] Invariant cache hit.
[2024-06-01 06:09:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-06-01 06:09:42] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 1/1 constraints]
After SMT, in 56747ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 56775ms
Finished structural reductions in LTL mode , in 1 iterations and 56813 ms. Remains : 184/186 places, 2105/2106 transitions.
[2024-06-01 06:10:12] [INFO ] Flatten gal took : 54 ms
[2024-06-01 06:10:12] [INFO ] Flatten gal took : 64 ms
[2024-06-01 06:10:13] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 184 transition count 2105
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 2105
Applied a total of 3 rules in 26 ms. Remains 184 /186 variables (removed 2) and now considering 2105/2106 (removed 1) transitions.
Running 2102 sub problems to find dead transitions.
[2024-06-01 06:10:13] [INFO ] Flow matrix only has 369 transitions (discarded 1736 similar events)
[2024-06-01 06:10:13] [INFO ] Invariant cache hit.
[2024-06-01 06:10:13] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-06-01 06:10:39] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 1/1 constraints]
After SMT, in 56170ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 56197ms
Finished structural reductions in LTL mode , in 1 iterations and 56229 ms. Remains : 184/186 places, 2105/2106 transitions.
[2024-06-01 06:11:09] [INFO ] Flatten gal took : 70 ms
[2024-06-01 06:11:09] [INFO ] Flatten gal took : 83 ms
[2024-06-01 06:11:09] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2106/2106 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 2106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 184 transition count 2105
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 2105
Applied a total of 3 rules in 23 ms. Remains 184 /186 variables (removed 2) and now considering 2105/2106 (removed 1) transitions.
Running 2102 sub problems to find dead transitions.
[2024-06-01 06:11:09] [INFO ] Flow matrix only has 369 transitions (discarded 1736 similar events)
[2024-06-01 06:11:09] [INFO ] Invariant cache hit.
[2024-06-01 06:11:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
[2024-06-01 06:11:37] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 20.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 1/1 constraints]
After SMT, in 56582ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 56604ms
Finished structural reductions in LTL mode , in 1 iterations and 56634 ms. Remains : 184/186 places, 2105/2106 transitions.
[2024-06-01 06:12:06] [INFO ] Flatten gal took : 44 ms
[2024-06-01 06:12:06] [INFO ] Flatten gal took : 49 ms
[2024-06-01 06:12:06] [INFO ] Input system was already deterministic with 2105 transitions.
[2024-06-01 06:12:06] [INFO ] Flatten gal took : 52 ms
[2024-06-01 06:12:06] [INFO ] Flatten gal took : 51 ms
[2024-06-01 06:12:06] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:12:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 186 places, 2106 transitions and 15772 arcs took 18 ms.
Total runtime 656122 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-15
BK_STOP 1717222328291
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/714/ctl_0_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/714/ctl_1_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/714/ctl_2_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/714/ctl_3_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/714/ctl_4_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/714/ctl_5_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/714/ctl_6_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/714/ctl_7_
ctl formula name BridgeAndVehicles-PT-V80P20N10-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/714/ctl_8_
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-V80P20N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V80P20N10, examination is CTLCardinality"
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-171620399200273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;