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.r025-smll-171620166400322.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 greatspnxred
Input is AutonomousCar-PT-07b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 334K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716350494029

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 04:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:01:37] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-05-22 04:01:37] [INFO ] Transformed 323 places.
[2024-05-22 04:01:37] [INFO ] Transformed 846 transitions.
[2024-05-22 04:01:37] [INFO ] Found NUPN structural information;
[2024-05-22 04:01:37] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 688 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 75 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 280 transition count 803
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 280 transition count 803
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 282 place count 280 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 287 place count 275 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 292 place count 275 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 274 transition count 601
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 274 transition count 601
Applied a total of 294 rules in 202 ms. Remains 274 /323 variables (removed 49) and now considering 601/846 (removed 245) transitions.
// Phase 1: matrix 601 rows 274 cols
[2024-05-22 04:01:37] [INFO ] Computed 12 invariants in 30 ms
[2024-05-22 04:01:38] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-22 04:01:38] [INFO ] Invariant cache hit.
[2024-05-22 04:01:38] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-22 04:01:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-22 04:01:53] [INFO ] Deduced a trap composed of 24 places in 532 ms of which 54 ms to minimize.
[2024-05-22 04:01:54] [INFO ] Deduced a trap composed of 71 places in 465 ms of which 6 ms to minimize.
[2024-05-22 04:01:54] [INFO ] Deduced a trap composed of 39 places in 410 ms of which 5 ms to minimize.
[2024-05-22 04:01:54] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 5 ms to minimize.
[2024-05-22 04:01:55] [INFO ] Deduced a trap composed of 40 places in 406 ms of which 3 ms to minimize.
[2024-05-22 04:01:55] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 3 ms to minimize.
[2024-05-22 04:01:55] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 5 ms to minimize.
[2024-05-22 04:01:56] [INFO ] Deduced a trap composed of 42 places in 402 ms of which 3 ms to minimize.
[2024-05-22 04:01:56] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 3 ms to minimize.
[2024-05-22 04:01:57] [INFO ] Deduced a trap composed of 40 places in 397 ms of which 4 ms to minimize.
[2024-05-22 04:01:57] [INFO ] Deduced a trap composed of 42 places in 380 ms of which 3 ms to minimize.
[2024-05-22 04:01:57] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 3 ms to minimize.
[2024-05-22 04:01:58] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:01:58] [INFO ] Deduced a trap composed of 29 places in 444 ms of which 4 ms to minimize.
[2024-05-22 04:01:59] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 4 ms to minimize.
[2024-05-22 04:01:59] [INFO ] Deduced a trap composed of 21 places in 433 ms of which 4 ms to minimize.
[2024-05-22 04:02:00] [INFO ] Deduced a trap composed of 44 places in 440 ms of which 5 ms to minimize.
[2024-05-22 04:02:00] [INFO ] Deduced a trap composed of 47 places in 450 ms of which 4 ms to minimize.
[2024-05-22 04:02:01] [INFO ] Deduced a trap composed of 47 places in 533 ms of which 5 ms to minimize.
[2024-05-22 04:02:01] [INFO ] Deduced a trap composed of 42 places in 414 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-22 04:02:02] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:02:03] [INFO ] Deduced a trap composed of 52 places in 400 ms of which 4 ms to minimize.
[2024-05-22 04:02:04] [INFO ] Deduced a trap composed of 41 places in 465 ms of which 4 ms to minimize.
[2024-05-22 04:02:04] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 5 ms to minimize.
[2024-05-22 04:02:05] [INFO ] Deduced a trap composed of 50 places in 428 ms of which 4 ms to minimize.
[2024-05-22 04:02:05] [INFO ] Deduced a trap composed of 60 places in 407 ms of which 4 ms to minimize.
[2024-05-22 04:02:05] [INFO ] Deduced a trap composed of 42 places in 413 ms of which 5 ms to minimize.
[2024-05-22 04:02:06] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 5 ms to minimize.
[2024-05-22 04:02:06] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 4 ms to minimize.
[2024-05-22 04:02:07] [INFO ] Deduced a trap composed of 50 places in 447 ms of which 4 ms to minimize.
[2024-05-22 04:02:07] [INFO ] Deduced a trap composed of 49 places in 445 ms of which 4 ms to minimize.
[2024-05-22 04:02:08] [INFO ] Deduced a trap composed of 57 places in 362 ms of which 5 ms to minimize.
[2024-05-22 04:02:08] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 4 ms to minimize.
[2024-05-22 04:02:09] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 5 ms to minimize.
[2024-05-22 04:02:09] [INFO ] Deduced a trap composed of 41 places in 339 ms of which 6 ms to minimize.
[2024-05-22 04:02:10] [INFO ] Deduced a trap composed of 53 places in 401 ms of which 4 ms to minimize.
[2024-05-22 04:02:10] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 4 ms to minimize.
[2024-05-22 04:02:10] [INFO ] Deduced a trap composed of 38 places in 372 ms of which 4 ms to minimize.
[2024-05-22 04:02:11] [INFO ] Deduced a trap composed of 43 places in 350 ms of which 4 ms to minimize.
SMT process timed out in 33057ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 33100ms
Starting structural reductions in LTL mode, iteration 1 : 274/323 places, 601/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34348 ms. Remains : 274/323 places, 601/846 transitions.
Support contains 75 out of 274 places after structural reductions.
[2024-05-22 04:02:12] [INFO ] Flatten gal took : 214 ms
[2024-05-22 04:02:12] [INFO ] Flatten gal took : 126 ms
[2024-05-22 04:02:12] [INFO ] Input system was already deterministic with 601 transitions.
RANDOM walk for 40000 steps (222 resets) in 3618 ms. (11 steps per ms) remains 40/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
[2024-05-22 04:02:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 223/274 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 601/875 variables, 274/286 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/875 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 0/875 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 286 constraints, problems are : Problem set: 2 solved, 38 unsolved in 2483 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 224/274 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 38 unsolved
[2024-05-22 04:02:17] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-22 04:02:18] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 2 ms to minimize.
Problem AtomicPropp14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 2/14 constraints. Problems are: Problem set: 3 solved, 37 unsolved
[2024-05-22 04:02:18] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 601/875 variables, 274/289 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 37/326 constraints. Problems are: Problem set: 3 solved, 37 unsolved
[2024-05-22 04:02:22] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/875 variables, and 327 constraints, problems are : Problem set: 3 solved, 37 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 37/40 constraints, Known Traps: 4/4 constraints]
After SMT, in 8070ms problems are : Problem set: 3 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 199 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1093 edges and 272 vertex of which 269 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 269 transition count 503
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 129 rules applied. Total rules applied 224 place count 178 transition count 465
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 247 place count 156 transition count 464
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 250 place count 155 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 154 transition count 462
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 251 place count 154 transition count 454
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 267 place count 146 transition count 454
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 274 place count 139 transition count 447
Iterating global reduction 5 with 7 rules applied. Total rules applied 281 place count 139 transition count 447
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 345 place count 107 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 346 place count 107 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 106 transition count 413
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 367 place count 106 transition count 394
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 386 place count 87 transition count 394
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 389 place count 87 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 86 transition count 393
Applied a total of 390 rules in 363 ms. Remains 86 /274 variables (removed 188) and now considering 393/601 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 86/274 places, 393/601 transitions.
RANDOM walk for 40000 steps (1459 resets) in 1111 ms. (35 steps per ms) remains 27/37 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4001 steps (13 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
// Phase 1: matrix 393 rows 86 cols
[2024-05-22 04:02:23] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 04:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 40/77 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 386/463 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 13/476 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 2/478 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/479 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 99 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 40/77 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 386/463 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 13/476 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 21/119 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 2/478 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 1/479 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 0/479 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 122 constraints, problems are : Problem set: 0 solved, 23 unsolved in 8881 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 10520ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 4034 ms.
Support contains 37 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 393/393 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 392
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 82 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 82 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 81 transition count 387
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 81 transition count 387
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 78 transition count 384
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 78 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 77 transition count 383
Applied a total of 19 rules in 62 ms. Remains 77 /86 variables (removed 9) and now considering 383/393 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 77/86 places, 383/393 transitions.
RANDOM walk for 40000 steps (1685 resets) in 596 ms. (67 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
// Phase 1: matrix 383 rows 77 cols
[2024-05-22 04:02:38] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 04:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 39/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 380/452 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 8/460 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/460 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 90 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 39/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 380/452 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 8/460 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 19/110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/460 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 110 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4083 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 5345ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 887 ms.
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 74 transition count 380
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 74 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 73 transition count 379
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 73 transition count 379
Applied a total of 9 rules in 51 ms. Remains 73 /77 variables (removed 4) and now considering 379/383 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 73/77 places, 379/383 transitions.
RANDOM walk for 40000 steps (1880 resets) in 507 ms. (78 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (20 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
// Phase 1: matrix 379 rows 73 cols
[2024-05-22 04:02:45] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 04:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/68 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 376/444 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 8/452 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 86 constraints, problems are : Problem set: 0 solved, 16 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/68 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 376/444 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 8/452 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/452 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 102 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 3263ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 735 ms.
Support contains 21 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 379/379 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 73 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 378
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 67 transition count 373
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 65 transition count 371
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 65 transition count 368
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 36 place count 62 transition count 354
Applied a total of 36 rules in 45 ms. Remains 62 /73 variables (removed 11) and now considering 354/379 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 62/73 places, 354/379 transitions.
RANDOM walk for 40000 steps (1783 resets) in 441 ms. (90 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (218 resets) in 56 ms. (701 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (189 resets) in 52 ms. (754 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (228 resets) in 64 ms. (615 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (233 resets) in 43 ms. (909 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (215 resets) in 43 ms. (909 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (207 resets) in 47 ms. (833 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (227 resets) in 41 ms. (952 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (181 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
// Phase 1: matrix 354 rows 62 cols
[2024-05-22 04:02:49] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 04:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 332/366 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/416 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 332/366 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/416 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 77 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 354/354 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 57 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 56 transition count 313
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 56 transition count 307
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 50 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 49 transition count 292
Applied a total of 41 rules in 49 ms. Remains 49 /62 variables (removed 13) and now considering 292/354 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 49/62 places, 292/354 transitions.
RANDOM walk for 40000 steps (450 resets) in 268 ms. (148 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
// Phase 1: matrix 292 rows 49 cols
[2024-05-22 04:02:50] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 04:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 273/296 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/341 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 273/296 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/341 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 292/292 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 284
Applied a total of 2 rules in 11 ms. Remains 48 /49 variables (removed 1) and now considering 284/292 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 48/49 places, 284/292 transitions.
RANDOM walk for 40000 steps (450 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1809953 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :0 out of 1
Probabilistic random walk after 1809953 steps, saw 253113 distinct states, run finished after 3007 ms. (steps per millisecond=601 ) properties seen :0
// Phase 1: matrix 284 rows 48 cols
[2024-05-22 04:02:53] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 04:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/289 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/332 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/289 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/332 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 284/284 transitions.
Applied a total of 0 rules in 10 ms. Remains 48 /48 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 48/48 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 284/284 transitions.
Applied a total of 0 rules in 10 ms. Remains 48 /48 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-22 04:02:54] [INFO ] Invariant cache hit.
[2024-05-22 04:02:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 04:02:54] [INFO ] Invariant cache hit.
[2024-05-22 04:02:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:02:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [43, 47]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 338 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/48 places, 283/284 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 281
Applied a total of 4 rules in 23 ms. Remains 44 /46 variables (removed 2) and now considering 281/283 (removed 2) transitions.
// Phase 1: matrix 281 rows 44 cols
[2024-05-22 04:02:54] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 04:02:54] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 04:02:54] [INFO ] Invariant cache hit.
[2024-05-22 04:02:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:02:55] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 44/48 places, 281/284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 685 ms. Remains : 44/48 places, 281/284 transitions.
RANDOM walk for 40000 steps (240 resets) in 690 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (52 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 588491 steps, run visited all 1 properties in 966 ms. (steps per millisecond=609 )
Probabilistic random walk after 588491 steps, saw 90815 distinct states, run finished after 972 ms. (steps per millisecond=605 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 04:02:56] [INFO ] Flatten gal took : 67 ms
[2024-05-22 04:02:56] [INFO ] Flatten gal took : 57 ms
[2024-05-22 04:02:56] [INFO ] Input system was already deterministic with 601 transitions.
Support contains 69 out of 274 places (down from 70) after GAL structural reductions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 242 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 271 transition count 497
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 140 rules applied. Total rules applied 242 place count 170 transition count 458
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 266 place count 147 transition count 457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 269 place count 146 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 145 transition count 455
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 270 place count 145 transition count 448
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 284 place count 138 transition count 448
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 292 place count 130 transition count 440
Iterating global reduction 5 with 8 rules applied. Total rules applied 300 place count 130 transition count 440
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 301 place count 129 transition count 433
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 129 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 304 place count 129 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 128 transition count 431
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 383 place count 89 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 384 place count 89 transition count 391
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 396 place count 77 transition count 308
Iterating global reduction 8 with 12 rules applied. Total rules applied 408 place count 77 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 10 rules applied. Total rules applied 418 place count 77 transition count 298
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 423 place count 72 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 425 place count 71 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 426 place count 71 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 428 place count 69 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 429 place count 68 transition count 294
Applied a total of 429 rules in 137 ms. Remains 68 /274 variables (removed 206) and now considering 294/601 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 68/274 places, 294/601 transitions.
[2024-05-22 04:02:56] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:02:56] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:02:56] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 242 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 274 place count 143 transition count 447
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 137 transition count 447
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 129 transition count 439
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 306 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 127 transition count 430
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 385 place count 88 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 88 transition count 390
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 396 place count 78 transition count 322
Iterating global reduction 6 with 10 rules applied. Total rules applied 406 place count 78 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 416 place count 78 transition count 312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 421 place count 73 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 423 place count 72 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 424 place count 72 transition count 310
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 72 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 427 place count 70 transition count 308
Applied a total of 427 rules in 99 ms. Remains 70 /274 variables (removed 204) and now considering 308/601 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 99 ms. Remains : 70/274 places, 308/601 transitions.
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 39 ms
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 39 ms
[2024-05-22 04:02:57] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 265 transition count 592
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 265 transition count 592
Applied a total of 18 rules in 13 ms. Remains 265 /274 variables (removed 9) and now considering 592/601 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 265/274 places, 592/601 transitions.
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 38 ms
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:02:57] [INFO ] Input system was already deterministic with 592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 14 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 263/274 places, 590/601 transitions.
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 34 ms
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 39 ms
[2024-05-22 04:02:57] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 18 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 263/274 places, 590/601 transitions.
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 48 ms
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 38 ms
[2024-05-22 04:02:57] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 16 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 263/274 places, 590/601 transitions.
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:02:57] [INFO ] Flatten gal took : 40 ms
[2024-05-22 04:02:58] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 245 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 274 place count 143 transition count 446
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 288 place count 136 transition count 446
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 296 place count 128 transition count 438
Iterating global reduction 3 with 8 rules applied. Total rules applied 304 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 127 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 127 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 308 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 126 transition count 429
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 387 place count 87 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 87 transition count 389
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 401 place count 74 transition count 298
Iterating global reduction 6 with 13 rules applied. Total rules applied 414 place count 74 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 12 rules applied. Total rules applied 426 place count 74 transition count 286
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 432 place count 68 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 434 place count 67 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 435 place count 67 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 437 place count 65 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 64 transition count 282
Applied a total of 438 rules in 72 ms. Remains 64 /274 variables (removed 210) and now considering 282/601 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 64/274 places, 282/601 transitions.
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 26 ms
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 31 ms
[2024-05-22 04:02:58] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 265 transition count 592
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 265 transition count 592
Applied a total of 18 rules in 11 ms. Remains 265 /274 variables (removed 9) and now considering 592/601 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 265/274 places, 592/601 transitions.
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 33 ms
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 37 ms
[2024-05-22 04:02:58] [INFO ] Input system was already deterministic with 592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 10 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 34 ms
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 37 ms
[2024-05-22 04:02:58] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 8 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 35 ms
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 36 ms
[2024-05-22 04:02:58] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 8 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 34 ms
[2024-05-22 04:02:58] [INFO ] Flatten gal took : 37 ms
[2024-05-22 04:02:59] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 7 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 33 ms
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 36 ms
[2024-05-22 04:02:59] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 8 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 31 ms
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 34 ms
[2024-05-22 04:02:59] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 257 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 274 place count 143 transition count 447
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 137 transition count 447
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 129 transition count 439
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 306 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 127 transition count 430
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 399 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 400 place count 81 transition count 383
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 413 place count 68 transition count 291
Iterating global reduction 6 with 13 rules applied. Total rules applied 426 place count 68 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 436 place count 68 transition count 281
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 441 place count 63 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 443 place count 62 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 62 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 62 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 60 transition count 277
Applied a total of 447 rules in 80 ms. Remains 60 /274 variables (removed 214) and now considering 277/601 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 60/274 places, 277/601 transitions.
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 26 ms
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 28 ms
[2024-05-22 04:02:59] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 259 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 271 transition count 494
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 146 rules applied. Total rules applied 251 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 276 place count 142 transition count 452
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 276 place count 142 transition count 446
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 288 place count 136 transition count 446
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 296 place count 128 transition count 438
Iterating global reduction 3 with 8 rules applied. Total rules applied 304 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 127 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 127 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 308 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 126 transition count 429
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 401 place count 80 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 402 place count 80 transition count 382
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 415 place count 67 transition count 290
Iterating global reduction 6 with 13 rules applied. Total rules applied 428 place count 67 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 438 place count 67 transition count 280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 443 place count 62 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 445 place count 61 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 61 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 447 place count 61 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 59 transition count 276
Applied a total of 449 rules in 76 ms. Remains 59 /274 variables (removed 215) and now considering 276/601 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 59/274 places, 276/601 transitions.
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 26 ms
[2024-05-22 04:02:59] [INFO ] Flatten gal took : 27 ms
[2024-05-22 04:02:59] [INFO ] Input system was already deterministic with 276 transitions.
RANDOM walk for 40000 steps (2281 resets) in 957 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (197 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 551329 steps, run visited all 1 properties in 883 ms. (steps per millisecond=624 )
Probabilistic random walk after 551329 steps, saw 84504 distinct states, run finished after 883 ms. (steps per millisecond=624 ) properties seen :1
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 8 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 264/274 places, 591/601 transitions.
[2024-05-22 04:03:01] [INFO ] Flatten gal took : 28 ms
[2024-05-22 04:03:01] [INFO ] Flatten gal took : 27 ms
[2024-05-22 04:03:01] [INFO ] Input system was already deterministic with 591 transitions.
[2024-05-22 04:03:01] [INFO ] Flatten gal took : 28 ms
[2024-05-22 04:03:01] [INFO ] Flatten gal took : 26 ms
[2024-05-22 04:03:01] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2024-05-22 04:03:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 274 places, 601 transitions and 4199 arcs took 8 ms.
Total runtime 84677 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-07b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 274
TRANSITIONS: 601
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.002s]


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


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

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

Process ID: 755
MODEL NAME: /home/mcc/execution/414/model
274 places, 601 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716351375923

--------------------
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

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="AutonomousCar-PT-07b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-07b, 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 r025-smll-171620166400322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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