Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810700074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m36, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717243826414

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:10:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:10:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:10:29] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2024-06-01 12:10:29] [INFO ] Transformed 1295 places.
[2024-06-01 12:10:29] [INFO ] Transformed 749 transitions.
[2024-06-01 12:10:29] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 736 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Deduced a syphon composed of 1036 places in 22 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 53 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 288 place count 211 transition count 461
Iterating global reduction 1 with 31 rules applied. Total rules applied 319 place count 211 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 325 place count 211 transition count 455
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 341 place count 195 transition count 439
Iterating global reduction 2 with 16 rules applied. Total rules applied 357 place count 195 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 361 place count 195 transition count 435
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 375 place count 181 transition count 420
Iterating global reduction 3 with 14 rules applied. Total rules applied 389 place count 181 transition count 420
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 424 place count 181 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 425 place count 180 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 180 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 427 place count 179 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 428 place count 179 transition count 381
Applied a total of 428 rules in 199 ms. Remains 179 /259 variables (removed 80) and now considering 381/749 (removed 368) transitions.
// Phase 1: matrix 381 rows 179 cols
[2024-06-01 12:10:30] [INFO ] Computed 5 invariants in 29 ms
[2024-06-01 12:10:30] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-06-01 12:10:30] [INFO ] Invariant cache hit.
[2024-06-01 12:10:31] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-06-01 12:10:32] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-06-01 12:10:32] [INFO ] Invariant cache hit.
[2024-06-01 12:10:32] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 1/179 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 26 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (OVERLAPS) 381/560 variables, 179/186 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 262/448 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 12:10:56] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 6 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 1/449 constraints. Problems are: Problem set: 3 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 449 constraints, problems are : Problem set: 3 solved, 377 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 179/179 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 4/179 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 381/560 variables, 179/187 constraints. Problems are: Problem set: 3 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 262/449 constraints. Problems are: Problem set: 3 solved, 377 unsolved
Problem TDEAD348 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 377/826 constraints. Problems are: Problem set: 4 solved, 376 unsolved
[2024-06-01 12:11:23] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:11:24] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 829 constraints, problems are : Problem set: 4 solved, 376 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 179/179 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 377/380 constraints, Known Traps: 6/6 constraints]
After SMT, in 61425ms problems are : Problem set: 4 solved, 376 unsolved
Search for dead transitions found 4 dead transitions in 61455ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 179/259 places, 377/749 transitions.
Reduce places removed 4 places and 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 175 transition count 376
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 6 ms. Remains 175 /179 variables (removed 4) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 175 cols
[2024-06-01 12:11:33] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 12:11:34] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 12:11:34] [INFO ] Invariant cache hit.
[2024-06-01 12:11:34] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 12:11:35] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 175/259 places, 376/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65251 ms. Remains : 175/259 places, 376/749 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 52 out of 174 places after structural reductions.
[2024-06-01 12:11:35] [INFO ] Flatten gal took : 137 ms
[2024-06-01 12:11:35] [INFO ] Flatten gal took : 78 ms
[2024-06-01 12:11:35] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 51 out of 174 places (down from 52) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 52 to 50
RANDOM walk for 40000 steps (8986 resets) in 5197 ms. (7 steps per ms) remains 47/50 properties
BEST_FIRST walk for 4002 steps (186 resets) in 95 ms. (41 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (190 resets) in 114 ms. (34 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (186 resets) in 58 ms. (67 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (199 resets) in 72 ms. (54 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (197 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (421 resets) in 84 ms. (47 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (184 resets) in 48 ms. (81 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (413 resets) in 56 ms. (70 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (189 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (186 resets) in 46 ms. (85 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (188 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (172 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (203 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (181 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (184 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (406 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (240 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (184 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (180 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (209 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (192 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (184 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (192 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (180 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (184 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (442 resets) in 71 ms. (55 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (197 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (190 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (187 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (192 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (199 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (180 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (195 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (203 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (197 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (419 resets) in 67 ms. (58 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (190 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (191 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (180 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (201 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (387 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (209 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (212 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (187 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (180 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (170 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (194 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
Interrupted probabilistic random walk after 391896 steps, run timeout after 6001 ms. (steps per millisecond=65 ) properties seen :26 out of 47
Probabilistic random walk after 391896 steps, saw 184723 distinct states, run finished after 6023 ms. (steps per millisecond=65 ) properties seen :26
// Phase 1: matrix 376 rows 174 cols
[2024-06-01 12:11:44] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 12:11:44] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 84/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 34/149 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 327/476 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 211/364 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 8 (OVERLAPS) 74/550 variables, 25/389 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 49/438 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/438 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/550 variables, 0/438 constraints. Problems are: Problem set: 7 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 438 constraints, problems are : Problem set: 7 solved, 14 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 86/105 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 36/141 variables, 2/4 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 271/412 variables, 141/145 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 155/300 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/300 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 138/550 variables, 33/333 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 105/438 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 14/452 constraints. Problems are: Problem set: 7 solved, 14 unsolved
[2024-06-01 12:11:47] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:11:47] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 2/454 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/454 constraints. Problems are: Problem set: 7 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/550 variables, 0/454 constraints. Problems are: Problem set: 7 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 454 constraints, problems are : Problem set: 7 solved, 14 unsolved in 3974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 14/21 constraints, Known Traps: 2/2 constraints]
After SMT, in 5707ms problems are : Problem set: 7 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 31916 ms.
Support contains 18 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 376/376 transitions.
Graph (complete) has 639 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 173 transition count 374
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 155 transition count 271
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 155 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 45 place count 155 transition count 265
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 58 place count 142 transition count 250
Iterating global reduction 2 with 13 rules applied. Total rules applied 71 place count 142 transition count 250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 142 transition count 245
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 83 place count 135 transition count 236
Iterating global reduction 3 with 7 rules applied. Total rules applied 90 place count 135 transition count 236
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 100 place count 135 transition count 226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 133 transition count 224
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 133 transition count 224
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 131 transition count 222
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 131 transition count 222
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 130 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 130 transition count 221
Applied a total of 110 rules in 82 ms. Remains 130 /174 variables (removed 44) and now considering 221/376 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 130/174 places, 221/376 transitions.
RANDOM walk for 40000 steps (8924 resets) in 548 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1860 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1943 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1877 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (4162 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 158 ms. (251 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (1885 resets) in 108 ms. (366 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1917 resets) in 72 ms. (547 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 350462 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 12
Probabilistic random walk after 350462 steps, saw 159835 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 221 rows 130 cols
[2024-06-01 12:12:26] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:12:26] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 69/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 205/291 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 116/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 60/351 variables, 44/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 16/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 265 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 69/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 205/291 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 116/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 60/351 variables, 44/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 16/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 12:12:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:12:28] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 279 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3194 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 4410ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 23532 ms.
Support contains 17 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 221/221 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 128 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 128 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 128 transition count 215
Applied a total of 8 rules in 37 ms. Remains 128 /130 variables (removed 2) and now considering 215/221 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 128/130 places, 215/221 transitions.
RANDOM walk for 40000 steps (8992 resets) in 453 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1898 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1910 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1950 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4097 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1931 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1962 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 339198 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 12
Probabilistic random walk after 339198 steps, saw 154606 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 215 rows 128 cols
[2024-06-01 12:12:58] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 12:12:58] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 67/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 199/283 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 111/198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 60/343 variables, 44/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 16/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 258 constraints, problems are : Problem set: 0 solved, 12 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 67/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 199/283 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 111/198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 60/343 variables, 44/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 16/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 271 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 3098ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 1 properties in 18437 ms.
Support contains 16 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 215/215 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 127 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 126 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 126 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 125 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 125 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 125 transition count 210
Applied a total of 7 rules in 26 ms. Remains 125 /128 variables (removed 3) and now considering 210/215 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 125/128 places, 210/215 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:13:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 12:13:19] [INFO ] Flatten gal took : 56 ms
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:13:19] [INFO ] Flatten gal took : 62 ms
[2024-06-01 12:13:19] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 35 out of 174 places (down from 42) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 68 stable transitions
Graph (complete) has 708 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 201
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 144 transition count 196
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 88 place count 121 transition count 171
Iterating global reduction 1 with 23 rules applied. Total rules applied 111 place count 121 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 119 place count 121 transition count 163
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 132 place count 108 transition count 149
Iterating global reduction 2 with 13 rules applied. Total rules applied 145 place count 108 transition count 149
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 156 place count 108 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 106 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 106 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 104 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 104 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 102 transition count 132
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 102 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 101 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 101 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 100 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 100 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 99 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 99 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 98 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 98 transition count 127
Applied a total of 176 rules in 68 ms. Remains 98 /174 variables (removed 76) and now considering 127/376 (removed 249) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 98/174 places, 127/376 transitions.
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:13:20] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 201
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 144 transition count 196
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 89 place count 120 transition count 170
Iterating global reduction 1 with 24 rules applied. Total rules applied 113 place count 120 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 122 place count 120 transition count 161
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 136 place count 106 transition count 146
Iterating global reduction 2 with 14 rules applied. Total rules applied 150 place count 106 transition count 146
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 162 place count 106 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 103 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 171 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 174 place count 100 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 98 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 94 transition count 121
Applied a total of 186 rules in 52 ms. Remains 94 /174 variables (removed 80) and now considering 121/376 (removed 255) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 94/174 places, 121/376 transitions.
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:13:20] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 145 transition count 193
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 145 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 145 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 86 place count 122 transition count 165
Iterating global reduction 1 with 23 rules applied. Total rules applied 109 place count 122 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 120 place count 122 transition count 154
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 133 place count 109 transition count 140
Iterating global reduction 2 with 13 rules applied. Total rules applied 146 place count 109 transition count 140
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 155 place count 109 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 106 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 106 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 103 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 103 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 169 place count 101 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 101 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 173 place count 101 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 175 place count 99 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 99 transition count 119
Applied a total of 177 rules in 74 ms. Remains 99 /174 variables (removed 75) and now considering 119/376 (removed 257) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 99/174 places, 119/376 transitions.
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 24 ms
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:13:20] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 190
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 143 transition count 185
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 118 transition count 158
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 118 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 118 transition count 148
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 103 transition count 132
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 103 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 168 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 87 transition count 102
Applied a total of 202 rules in 97 ms. Remains 87 /174 variables (removed 87) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 87/174 places, 102/376 transitions.
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:13:20] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:13:20] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (8970 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2374410 steps, run timeout after 3001 ms. (steps per millisecond=791 ) properties seen :0 out of 1
Probabilistic random walk after 2374410 steps, saw 1029881 distinct states, run finished after 3001 ms. (steps per millisecond=791 ) properties seen :0
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:13:23] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:13:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:13:23] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 244 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 6 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 86/87 places, 100/102 transitions.
RANDOM walk for 4000000 steps (897212 resets) in 8244 ms. (485 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (190597 resets) in 2683 ms. (1490 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 8173628 steps, run timeout after 9001 ms. (steps per millisecond=908 ) properties seen :0 out of 1
Probabilistic random walk after 8173628 steps, saw 3525448 distinct states, run finished after 9001 ms. (steps per millisecond=908 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:13:36] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 12:13:36] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 273 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:13:36] [INFO ] Invariant cache hit.
[2024-06-01 12:13:37] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 12:13:37] [INFO ] Invariant cache hit.
[2024-06-01 12:13:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:13:37] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-01 12:13:37] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:13:37] [INFO ] Invariant cache hit.
[2024-06-01 12:13:37] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4099 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:13:45] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9315 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 13571ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13574ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14082 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 400000 steps (89629 resets) in 2745 ms. (145 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 12:13:51] [INFO ] Invariant cache hit.
[2024-06-01 12:13:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:13:51] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 12:13:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:13:51] [INFO ] After 14ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:13:51] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:13:51] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:13:52] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:13:52] [INFO ] After 11ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:13:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-06-01 12:13:52] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:13:52] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (896458 resets) in 7723 ms. (517 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (191204 resets) in 2829 ms. (1413 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5304731 steps, run timeout after 6001 ms. (steps per millisecond=883 ) properties seen :0 out of 1
Probabilistic random walk after 5304731 steps, saw 2292759 distinct states, run finished after 6004 ms. (steps per millisecond=883 ) properties seen :0
[2024-06-01 12:14:01] [INFO ] Invariant cache hit.
[2024-06-01 12:14:01] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 180 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:14:01] [INFO ] Invariant cache hit.
[2024-06-01 12:14:01] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:14:01] [INFO ] Invariant cache hit.
[2024-06-01 12:14:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:14:01] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-06-01 12:14:01] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:14:01] [INFO ] Invariant cache hit.
[2024-06-01 12:14:01] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:14:08] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 11185ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 11188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11614 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 400000 steps (89627 resets) in 642 ms. (622 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 12:14:13] [INFO ] Invariant cache hit.
[2024-06-01 12:14:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:14:13] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 12:14:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:14:13] [INFO ] After 16ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:14:13] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:14:13] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:14:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:14:13] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:14:13] [INFO ] After 16ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:14:13] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 1
[2024-06-01 12:14:13] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:14:13] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8969 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4148 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2368586 steps, run timeout after 3001 ms. (steps per millisecond=789 ) properties seen :0 out of 1
Probabilistic random walk after 2368586 steps, saw 1027505 distinct states, run finished after 3001 ms. (steps per millisecond=789 ) properties seen :0
[2024-06-01 12:14:16] [INFO ] Invariant cache hit.
[2024-06-01 12:14:16] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 95/180 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/180 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:14:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 40000 steps (8933 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4190 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2657657 steps, run timeout after 3001 ms. (steps per millisecond=885 ) properties seen :0 out of 1
Probabilistic random walk after 2657657 steps, saw 1151305 distinct states, run finished after 3001 ms. (steps per millisecond=885 ) properties seen :0
[2024-06-01 12:14:20] [INFO ] Invariant cache hit.
[2024-06-01 12:14:20] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 95/180 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/180 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:14:20] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:14:20] [INFO ] Invariant cache hit.
[2024-06-01 12:14:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 12:14:20] [INFO ] Invariant cache hit.
[2024-06-01 12:14:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:14:21] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-06-01 12:14:21] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:14:21] [INFO ] Invariant cache hit.
[2024-06-01 12:14:21] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3841 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:14:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7822 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 11806ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 11808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12311 ms. Remains : 86/86 places, 100/100 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 92
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 80 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 80 transition count 78
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 66 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 59 transition count 71
Applied a total of 56 rules in 17 ms. Remains 59 /86 variables (removed 27) and now considering 71/100 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 59 cols
[2024-06-01 12:14:33] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:14:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:14:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:14:33] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2024-06-01 12:14:33] [INFO ] After 109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:14:33] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:14:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:14:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:14:33] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
TRAPS : Iteration 1
[2024-06-01 12:14:33] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:14:33] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 397 ms.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 13 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:14:33] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 12:14:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:14:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:14:33] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:14:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:14:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:14:33] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:14:33] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:14:33] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 276 ms.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 190
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 143 transition count 185
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 118 transition count 158
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 118 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 118 transition count 148
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 103 transition count 132
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 103 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 168 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 87 transition count 102
Applied a total of 202 rules in 20 ms. Remains 87 /174 variables (removed 87) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 87/174 places, 102/376 transitions.
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:14:33] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 180
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 143 transition count 176
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 92 place count 117 transition count 148
Iterating global reduction 1 with 26 rules applied. Total rules applied 118 place count 117 transition count 148
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 129 place count 117 transition count 137
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 145 place count 101 transition count 120
Iterating global reduction 2 with 16 rules applied. Total rules applied 161 place count 101 transition count 120
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 171 place count 101 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 96 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 185 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 92 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 89 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 89 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 87 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 86 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 205 place count 84 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 84 transition count 91
Applied a total of 206 rules in 19 ms. Remains 84 /174 variables (removed 90) and now considering 91/376 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 84/174 places, 91/376 transitions.
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:14:33] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 152 transition count 262
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 152 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 152 transition count 258
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 135 transition count 239
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 135 transition count 239
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 135 transition count 232
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 126 transition count 222
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 126 transition count 222
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 118 place count 126 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 124 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 124 transition count 209
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 122 transition count 207
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 122 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 121 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 121 transition count 206
Applied a total of 128 rules in 19 ms. Remains 121 /174 variables (removed 53) and now considering 206/376 (removed 170) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 121/174 places, 206/376 transitions.
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:14:33] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 190
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 143 transition count 185
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 118 transition count 158
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 118 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 118 transition count 148
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 103 transition count 132
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 103 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 168 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 87 transition count 102
Applied a total of 202 rules in 19 ms. Remains 87 /174 variables (removed 87) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 87/174 places, 102/376 transitions.
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:14:33] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 190
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 143 transition count 185
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 118 transition count 158
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 118 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 118 transition count 148
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 103 transition count 132
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 103 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 168 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 87 transition count 102
Applied a total of 202 rules in 39 ms. Remains 87 /174 variables (removed 87) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 87/174 places, 102/376 transitions.
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:14:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:14:34] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (8964 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2508291 steps, run timeout after 3001 ms. (steps per millisecond=835 ) properties seen :0 out of 1
Probabilistic random walk after 2508291 steps, saw 1033434 distinct states, run finished after 3002 ms. (steps per millisecond=835 ) properties seen :0
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:14:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:14:37] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:14:37] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 244 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 9 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/87 places, 100/102 transitions.
RANDOM walk for 4000000 steps (897558 resets) in 6271 ms. (637 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (190949 resets) in 2611 ms. (1531 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4405183 steps, run timeout after 6001 ms. (steps per millisecond=734 ) properties seen :0 out of 1
Probabilistic random walk after 4405183 steps, saw 1815611 distinct states, run finished after 6001 ms. (steps per millisecond=734 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:14:46] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:14:46] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:14:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 172 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:14:47] [INFO ] Invariant cache hit.
[2024-06-01 12:14:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 12:14:47] [INFO ] Invariant cache hit.
[2024-06-01 12:14:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:14:47] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-01 12:14:47] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:14:47] [INFO ] Invariant cache hit.
[2024-06-01 12:14:47] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4610 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:14:54] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9377 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 14126ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 14128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14498 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 400000 steps (89819 resets) in 709 ms. (563 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 12:15:01] [INFO ] Invariant cache hit.
[2024-06-01 12:15:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:15:01] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 12:15:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:15:01] [INFO ] After 22ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:01] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:01] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:15:01] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:02] [INFO ] After 23ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:02] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:15:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-06-01 12:15:02] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:02] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (895941 resets) in 5866 ms. (681 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (191138 resets) in 2568 ms. (1557 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4378139 steps, run timeout after 6001 ms. (steps per millisecond=729 ) properties seen :0 out of 1
Probabilistic random walk after 4378139 steps, saw 1804697 distinct states, run finished after 6004 ms. (steps per millisecond=729 ) properties seen :0
[2024-06-01 12:15:10] [INFO ] Invariant cache hit.
[2024-06-01 12:15:10] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:15:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 275 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:15:11] [INFO ] Invariant cache hit.
[2024-06-01 12:15:11] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 12:15:11] [INFO ] Invariant cache hit.
[2024-06-01 12:15:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:15:11] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-06-01 12:15:11] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:15:11] [INFO ] Invariant cache hit.
[2024-06-01 12:15:11] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3475 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:15:17] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 12425ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12955 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 400000 steps (89492 resets) in 654 ms. (610 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 12:15:24] [INFO ] Invariant cache hit.
[2024-06-01 12:15:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:15:24] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 12:15:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:15:24] [INFO ] After 17ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:24] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:24] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:15:24] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:24] [INFO ] After 18ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:24] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2024-06-01 12:15:24] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:24] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8982 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4222 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2104262 steps, run timeout after 3001 ms. (steps per millisecond=701 ) properties seen :0 out of 1
Probabilistic random walk after 2104262 steps, saw 876259 distinct states, run finished after 3001 ms. (steps per millisecond=701 ) properties seen :0
[2024-06-01 12:15:27] [INFO ] Invariant cache hit.
[2024-06-01 12:15:27] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/180 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/180 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:15:27] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 40000 steps (8960 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4163 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1998119 steps, run timeout after 3001 ms. (steps per millisecond=665 ) properties seen :0 out of 1
Probabilistic random walk after 1998119 steps, saw 830848 distinct states, run finished after 3003 ms. (steps per millisecond=665 ) properties seen :0
[2024-06-01 12:15:31] [INFO ] Invariant cache hit.
[2024-06-01 12:15:31] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/180 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/180 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:15:31] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:15:31] [INFO ] Invariant cache hit.
[2024-06-01 12:15:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 12:15:31] [INFO ] Invariant cache hit.
[2024-06-01 12:15:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:15:31] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-06-01 12:15:31] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:15:31] [INFO ] Invariant cache hit.
[2024-06-01 12:15:31] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4766 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:15:38] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8855 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 13754ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13757ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14119 ms. Remains : 86/86 places, 100/100 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 92
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 80 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 80 transition count 78
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 66 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 59 transition count 71
Applied a total of 56 rules in 15 ms. Remains 59 /86 variables (removed 27) and now considering 71/100 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 59 cols
[2024-06-01 12:15:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:15:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:15:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:15:45] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:45] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-01 12:15:45] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:45] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:15:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:15:45] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:45] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 12:15:45] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:45] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 9 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:15:45] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 12:15:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:15:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:15:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:15:45] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:15:46] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:46] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:46] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 149 transition count 229
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 149 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 149 transition count 224
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 74 place count 130 transition count 203
Iterating global reduction 1 with 19 rules applied. Total rules applied 93 place count 130 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 100 place count 130 transition count 196
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 110 place count 120 transition count 186
Iterating global reduction 2 with 10 rules applied. Total rules applied 120 place count 120 transition count 186
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 134 place count 120 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 119 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 119 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 118 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 118 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 117 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 117 transition count 169
Applied a total of 140 rules in 22 ms. Remains 117 /174 variables (removed 57) and now considering 169/376 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 117/174 places, 169/376 transitions.
[2024-06-01 12:15:46] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:15:46] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:15:46] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 179
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 142 transition count 174
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 94 place count 117 transition count 147
Iterating global reduction 1 with 25 rules applied. Total rules applied 119 place count 117 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 129 place count 117 transition count 137
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 144 place count 102 transition count 121
Iterating global reduction 2 with 15 rules applied. Total rules applied 159 place count 102 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 102 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 98 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 98 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 94 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 94 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 91 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 91 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 91 transition count 100
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 193 place count 89 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 89 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 88 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 87 transition count 95
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 86 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 86 transition count 94
Applied a total of 201 rules in 30 ms. Remains 86 /174 variables (removed 88) and now considering 94/376 (removed 282) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 86/174 places, 94/376 transitions.
[2024-06-01 12:15:46] [INFO ] Flatten gal took : 4 ms
[2024-06-01 12:15:46] [INFO ] Flatten gal took : 4 ms
[2024-06-01 12:15:46] [INFO ] Input system was already deterministic with 94 transitions.
RANDOM walk for 40000 steps (9012 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4145 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2325615 steps, run timeout after 3001 ms. (steps per millisecond=774 ) properties seen :0 out of 1
Probabilistic random walk after 2325615 steps, saw 960592 distinct states, run finished after 3002 ms. (steps per millisecond=774 ) properties seen :0
// Phase 1: matrix 94 rows 86 cols
[2024-06-01 12:15:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:15:49] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/148 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/180 variables, 19/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 13/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/180 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/148 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/180 variables, 19/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 13/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:15:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/180 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 94/94 transitions.
Graph (complete) has 236 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 92
Applied a total of 3 rules in 4 ms. Remains 85 /86 variables (removed 1) and now considering 92/94 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/86 places, 92/94 transitions.
RANDOM walk for 4000000 steps (898401 resets) in 4747 ms. (842 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (414136 resets) in 2550 ms. (1568 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2345461 steps, run timeout after 3001 ms. (steps per millisecond=781 ) properties seen :0 out of 1
Probabilistic random walk after 2345461 steps, saw 968679 distinct states, run finished after 3002 ms. (steps per millisecond=781 ) properties seen :0
// Phase 1: matrix 92 rows 85 cols
[2024-06-01 12:15:54] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:15:54] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/120 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/125 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:15:54] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/127 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 50/177 variables, 60/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/125 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/127 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/177 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:15:54] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 12:15:54] [INFO ] Invariant cache hit.
[2024-06-01 12:15:54] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 12:15:54] [INFO ] Invariant cache hit.
[2024-06-01 12:15:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:15:55] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-01 12:15:55] [INFO ] Redundant transitions in 1 ms returned []
Running 91 sub problems to find dead transitions.
[2024-06-01 12:15:55] [INFO ] Invariant cache hit.
[2024-06-01 12:15:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/177 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 12:15:57] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/177 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/177 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 216 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
After SMT, in 8868ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 8870ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9185 ms. Remains : 85/85 places, 92/92 transitions.
RANDOM walk for 400000 steps (89640 resets) in 753 ms. (530 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2024-06-01 12:16:04] [INFO ] Invariant cache hit.
[2024-06-01 12:16:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:16:04] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:16:04] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 12:16:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:16:04] [INFO ] After 14ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:16:04] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:16:04] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:16:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:16:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:16:04] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 12:16:04] [INFO ] After 13ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:16:04] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:16:04] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (897633 resets) in 4689 ms. (852 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (414209 resets) in 2868 ms. (1394 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2374227 steps, run timeout after 3001 ms. (steps per millisecond=791 ) properties seen :0 out of 1
Probabilistic random walk after 2374227 steps, saw 979871 distinct states, run finished after 3001 ms. (steps per millisecond=791 ) properties seen :0
[2024-06-01 12:16:09] [INFO ] Invariant cache hit.
[2024-06-01 12:16:09] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/120 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/125 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:16:09] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/127 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 50/177 variables, 60/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/79 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/125 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/127 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/177 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:16:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 12:16:09] [INFO ] Invariant cache hit.
[2024-06-01 12:16:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 12:16:09] [INFO ] Invariant cache hit.
[2024-06-01 12:16:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:16:10] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-01 12:16:10] [INFO ] Redundant transitions in 1 ms returned []
Running 91 sub problems to find dead transitions.
[2024-06-01 12:16:10] [INFO ] Invariant cache hit.
[2024-06-01 12:16:10] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/177 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 12:16:12] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/177 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/177 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 216 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4794 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 1/1 constraints]
After SMT, in 9011ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 9013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9327 ms. Remains : 85/85 places, 92/92 transitions.
RANDOM walk for 400000 steps (89719 resets) in 830 ms. (481 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2024-06-01 12:16:19] [INFO ] Invariant cache hit.
[2024-06-01 12:16:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:16:19] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:16:19] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 12:16:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:16:19] [INFO ] After 15ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:16:19] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:16:19] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 12:16:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:16:19] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:16:19] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 12:16:19] [INFO ] After 12ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 12:16:19] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 12:16:19] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 40000 steps (8961 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4078 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2060 steps, run visited all 1 properties in 7 ms. (steps per millisecond=294 )
Probabilistic random walk after 2060 steps, saw 1007 distinct states, run finished after 13 ms. (steps per millisecond=158 ) properties seen :1
RANDOM walk for 40000 steps (8922 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4152 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1587 steps, run visited all 1 properties in 25 ms. (steps per millisecond=63 )
Probabilistic random walk after 1587 steps, saw 780 distinct states, run finished after 26 ms. (steps per millisecond=61 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 84
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 79 transition count 84
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 79 transition count 70
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 65 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 59 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 58 transition count 69
Applied a total of 56 rules in 12 ms. Remains 58 /85 variables (removed 27) and now considering 69/92 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 58 cols
[2024-06-01 12:16:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:16:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:16:19] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:16:19] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:16:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:16:19] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:16:19] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:16:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-06-01 12:16:20] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:16:20] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 232 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 190
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 143 transition count 185
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 118 transition count 158
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 118 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 118 transition count 148
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 103 transition count 132
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 103 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 168 place count 103 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 99 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 90 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 87 transition count 102
Applied a total of 202 rules in 20 ms. Remains 87 /174 variables (removed 87) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 87/174 places, 102/376 transitions.
[2024-06-01 12:16:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 12:16:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 12:16:20] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (9022 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2156256 steps, run timeout after 3001 ms. (steps per millisecond=718 ) properties seen :0 out of 1
Probabilistic random walk after 2156256 steps, saw 891607 distinct states, run finished after 3001 ms. (steps per millisecond=718 ) properties seen :0
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 12:16:23] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:16:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/156 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/189 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:16:23] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 525ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 244 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 3 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/87 places, 100/102 transitions.
RANDOM walk for 4000000 steps (896621 resets) in 5719 ms. (699 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (191360 resets) in 2581 ms. (1549 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4589143 steps, run timeout after 6001 ms. (steps per millisecond=764 ) properties seen :0 out of 1
Probabilistic random walk after 4589143 steps, saw 1889424 distinct states, run finished after 6002 ms. (steps per millisecond=764 ) properties seen :0
// Phase 1: matrix 100 rows 86 cols
[2024-06-01 12:16:31] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:16:31] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 288 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:16:32] [INFO ] Invariant cache hit.
[2024-06-01 12:16:32] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 12:16:32] [INFO ] Invariant cache hit.
[2024-06-01 12:16:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:16:33] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-06-01 12:16:33] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:16:33] [INFO ] Invariant cache hit.
[2024-06-01 12:16:33] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:16:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9216 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 13505ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13983 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 400000 steps (89711 resets) in 866 ms. (461 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 12:16:46] [INFO ] Invariant cache hit.
[2024-06-01 12:16:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:16:46] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 12:16:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:16:47] [INFO ] After 23ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:16:47] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:16:47] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:16:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:16:47] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:16:47] [INFO ] After 24ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:16:47] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:16:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-06-01 12:16:47] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:16:47] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (896579 resets) in 5809 ms. (688 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (191877 resets) in 2542 ms. (1572 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4491154 steps, run timeout after 6001 ms. (steps per millisecond=748 ) properties seen :0 out of 1
Probabilistic random walk after 4491154 steps, saw 1850461 distinct states, run finished after 6001 ms. (steps per millisecond=748 ) properties seen :0
[2024-06-01 12:16:55] [INFO ] Invariant cache hit.
[2024-06-01 12:16:55] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/180 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 286 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:16:56] [INFO ] Invariant cache hit.
[2024-06-01 12:16:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 12:16:56] [INFO ] Invariant cache hit.
[2024-06-01 12:16:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:16:56] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-06-01 12:16:56] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:16:56] [INFO ] Invariant cache hit.
[2024-06-01 12:16:56] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3876 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:17:02] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8433 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 12444ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12938 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 400000 steps (89490 resets) in 860 ms. (464 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 12:17:09] [INFO ] Invariant cache hit.
[2024-06-01 12:17:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 12:17:09] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 12:17:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:17:09] [INFO ] After 24ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:09] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:09] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 12:17:09] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 12:17:09] [INFO ] After 24ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:09] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:17:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-06-01 12:17:09] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:17:09] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8925 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4172 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2064438 steps, run timeout after 3001 ms. (steps per millisecond=687 ) properties seen :0 out of 1
Probabilistic random walk after 2064438 steps, saw 859137 distinct states, run finished after 3001 ms. (steps per millisecond=687 ) properties seen :0
[2024-06-01 12:17:12] [INFO ] Invariant cache hit.
[2024-06-01 12:17:12] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/180 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/180 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:17:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 100/100 transitions.
RANDOM walk for 40000 steps (9049 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4153 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2135373 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :0 out of 1
Probabilistic random walk after 2135373 steps, saw 889359 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :0
[2024-06-01 12:17:16] [INFO ] Invariant cache hit.
[2024-06-01 12:17:16] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/180 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/85 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/180 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/186 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:17:16] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-06-01 12:17:16] [INFO ] Invariant cache hit.
[2024-06-01 12:17:16] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 12:17:16] [INFO ] Invariant cache hit.
[2024-06-01 12:17:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:17:17] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-01 12:17:17] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 12:17:17] [INFO ] Invariant cache hit.
[2024-06-01 12:17:17] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4625 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/186 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:17:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 1/1 constraints]
After SMT, in 14122ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 14124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14505 ms. Remains : 86/86 places, 100/100 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 92
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 80 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 80 transition count 78
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 66 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 59 transition count 71
Applied a total of 56 rules in 6 ms. Remains 59 /86 variables (removed 27) and now considering 71/100 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 59 cols
[2024-06-01 12:17:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:17:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:17:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:17:31] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:31] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-01 12:17:31] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:31] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:17:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:17:31] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:31] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:17:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 1
[2024-06-01 12:17:31] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:17:31] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 272 ms.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 86 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 80 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 13 place count 80 transition count 79
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 41 place count 66 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 59 transition count 72
Applied a total of 55 rules in 9 ms. Remains 59 /86 variables (removed 27) and now considering 72/100 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 59 cols
[2024-06-01 12:17:31] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:17:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:17:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:17:31] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:17:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 12:17:31] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:31] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:17:31] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 279 ms.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 376/376 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 149 transition count 220
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 149 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 149 transition count 216
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 128 transition count 193
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 128 transition count 193
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 128 transition count 187
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 114 place count 116 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 116 transition count 173
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 139 place count 116 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 113 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 113 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 110 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 110 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 109 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 109 transition count 153
Applied a total of 153 rules in 19 ms. Remains 109 /174 variables (removed 65) and now considering 153/376 (removed 223) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 109/174 places, 153/376 transitions.
[2024-06-01 12:17:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:17:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:17:31] [INFO ] Input system was already deterministic with 153 transitions.
[2024-06-01 12:17:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:17:31] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:17:31] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 12:17:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 376 transitions and 1485 arcs took 8 ms.
Total runtime 422976 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 : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-14

BK_STOP 1717244252479

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1154/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1154/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1154/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1154/ctl_3_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1154/ctl_4_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1154/ctl_5_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1154/ctl_6_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1154/ctl_7_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1154/ctl_8_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1154/ctl_9_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1154/ctl_10_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1154/ctl_11_
ctl formula name SieveSingleMsgMbox-PT-d1m36-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1154/ctl_12_
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="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="CTLFireability"
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 SieveSingleMsgMbox-PT-d1m36, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810700074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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