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.r468-smll-171620167500330.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 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 448K 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-08a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717216778331

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:39:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:39:40] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-06-01 04:39:40] [INFO ] Transformed 81 places.
[2024-06-01 04:39:40] [INFO ] Transformed 849 transitions.
[2024-06-01 04:39:40] [INFO ] Found NUPN structural information;
[2024-06-01 04:39:40] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Support contains 69 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 51 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2024-06-01 04:39:40] [INFO ] Computed 12 invariants in 24 ms
[2024-06-01 04:39:40] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 04:39:40] [INFO ] Invariant cache hit.
[2024-06-01 04:39:41] [INFO ] State equation strengthened by 259 read => feed constraints.
[2024-06-01 04:39:41] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 572 sub problems to find dead transitions.
[2024-06-01 04:39:41] [INFO ] Invariant cache hit.
[2024-06-01 04:39:41] [INFO ] State equation strengthened by 259 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-06-01 04:39:52] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 19 ms to minimize.
[2024-06-01 04:39:52] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 3 ms to minimize.
[2024-06-01 04:39:55] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 04:39:56] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-06-01 04:39:57] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 572/652 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 258/355 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 8 (OVERLAPS) 1/653 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/653 variables, and 356 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (OVERLAPS) 572/652 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/652 variables, 258/355 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 572/927 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-06-01 04:40:46] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 652/653 variables, and 928 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 258/259 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 6/6 constraints]
After SMT, in 66911ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 66972ms
Starting structural reductions in LTL mode, iteration 1 : 80/81 places, 573/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67757 ms. Remains : 80/81 places, 573/574 transitions.
Support contains 69 out of 80 places after structural reductions.
[2024-06-01 04:40:48] [INFO ] Flatten gal took : 209 ms
[2024-06-01 04:40:49] [INFO ] Flatten gal took : 123 ms
[2024-06-01 04:40:49] [INFO ] Input system was already deterministic with 573 transitions.
RANDOM walk for 40000 steps (2047 resets) in 4620 ms. (8 steps per ms) remains 60/125 properties
BEST_FIRST walk for 4004 steps (13 resets) in 46 ms. (85 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (14 resets) in 44 ms. (88 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (13 resets) in 36 ms. (108 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4001 steps (12 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (19 resets) in 36 ms. (108 steps per ms) remains 53/55 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (20 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 49/51 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (13 resets) in 55 ms. (71 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (12 resets) in 43 ms. (91 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (18 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
[2024-06-01 04:40:51] [INFO ] Invariant cache hit.
[2024-06-01 04:40:51] [INFO ] State equation strengthened by 259 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp118 is UNSAT
Problem AtomicPropp121 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/78 variables, 11/11 constraints. Problems are: Problem set: 7 solved, 37 unsolved
[2024-06-01 04:40:52] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 2/80 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 572/652 variables, 80/93 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 258/351 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/351 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/653 variables, 1/352 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/352 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/352 constraints. Problems are: Problem set: 7 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 352 constraints, problems are : Problem set: 7 solved, 37 unsolved in 3031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 7 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 31/78 variables, 11/11 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 2/80 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 572/652 variables, 80/93 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 258/351 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 37/388 constraints. Problems are: Problem set: 7 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/388 constraints. Problems are: Problem set: 7 solved, 37 unsolved
SMT process timed out in 9042ms, After SMT, problems are : Problem set: 7 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 573/573 transitions.
Graph (complete) has 853 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 79 transition count 568
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 77 transition count 568
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 9 place count 76 transition count 567
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 76 transition count 564
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 73 transition count 564
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 73 transition count 564
Applied a total of 16 rules in 256 ms. Remains 73 /80 variables (removed 7) and now considering 564/573 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 73/80 places, 564/573 transitions.
RANDOM walk for 40000 steps (931 resets) in 1017 ms. (39 steps per ms) remains 33/37 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (17 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
// Phase 1: matrix 564 rows 73 cols
[2024-06-01 04:41:01] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 04:41:01] [INFO ] State equation strengthened by 259 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 26/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 5/73 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 564/637 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 259/345 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/637 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 345 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 73/73 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 26/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 5/73 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 564/637 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 259/345 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 30/375 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/637 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 637/637 variables, and 375 constraints, problems are : Problem set: 0 solved, 30 unsolved in 8784 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 73/73 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 10636ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 7 properties in 10043 ms.
Support contains 26 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 564/564 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 73 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 563
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 2 with 2 rules applied. Total rules applied 4 place count 71 transition count 562
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 71 transition count 559
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 18 place count 68 transition count 551
Applied a total of 18 rules in 94 ms. Remains 68 /73 variables (removed 5) and now considering 551/564 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 68/73 places, 551/564 transitions.
RANDOM walk for 40000 steps (930 resets) in 972 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 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 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 293336 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 21
Probabilistic random walk after 293336 steps, saw 48561 distinct states, run finished after 3010 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 551 rows 68 cols
[2024-06-01 04:41:25] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 04:41:25] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 39/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 5/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 551/619 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/619 variables, 251/332 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/619 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 619/619 variables, and 332 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 39/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 5/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 551/619 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/619 variables, 251/332 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 21/353 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/619 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 619/619 variables, and 353 constraints, problems are : Problem set: 0 solved, 21 unsolved in 4470 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 5796ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 6124 ms.
Support contains 24 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 551/551 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 550
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 66 transition count 541
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 66 transition count 541
Applied a total of 4 rules in 51 ms. Remains 66 /68 variables (removed 2) and now considering 541/551 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 66/68 places, 541/551 transitions.
RANDOM walk for 40000 steps (1335 resets) in 881 ms. (45 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 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 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 331404 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 21
Probabilistic random walk after 331404 steps, saw 52950 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 541 rows 66 cols
[2024-06-01 04:41:40] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 04:41:40] [INFO ] State equation strengthened by 243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 37/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 541/607 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 243/322 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/607 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 322 constraints, problems are : Problem set: 0 solved, 21 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 37/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 04:41:42] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 541/607 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 243/323 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 21/344 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/607 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 607/607 variables, and 344 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5434 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints]
After SMT, in 6643ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 1309 ms.
Support contains 24 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 541/541 transitions.
Applied a total of 0 rules in 33 ms. Remains 66 /66 variables (removed 0) and now considering 541/541 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 66/66 places, 541/541 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 541/541 transitions.
Applied a total of 0 rules in 31 ms. Remains 66 /66 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2024-06-01 04:41:48] [INFO ] Invariant cache hit.
[2024-06-01 04:41:49] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 04:41:49] [INFO ] Invariant cache hit.
[2024-06-01 04:41:49] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-06-01 04:41:49] [INFO ] Implicit Places using invariants and state equation in 410 ms returned [62, 64]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 605 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/66 places, 541/541 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 63 transition count 540
Applied a total of 2 rules in 36 ms. Remains 63 /64 variables (removed 1) and now considering 540/541 (removed 1) transitions.
// Phase 1: matrix 540 rows 63 cols
[2024-06-01 04:41:49] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 04:41:49] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 04:41:49] [INFO ] Invariant cache hit.
[2024-06-01 04:41:49] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-06-01 04:41:50] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/66 places, 540/541 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1208 ms. Remains : 63/66 places, 540/541 transitions.
RANDOM walk for 40000 steps (1219 resets) in 2298 ms. (17 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 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 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 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 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (17 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 335666 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 20
Probabilistic random walk after 335666 steps, saw 53464 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-06-01 04:41:53] [INFO ] Invariant cache hit.
[2024-06-01 04:41:53] [INFO ] State equation strengthened by 243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 538/598 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 242/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/603 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 317 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 538/598 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 242/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/603 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/603 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 337 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4706 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 6103ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 4213 ms.
Support contains 24 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 540/540 transitions.
Applied a total of 0 rules in 29 ms. Remains 63 /63 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 63/63 places, 540/540 transitions.
RANDOM walk for 40000 steps (1476 resets) in 782 ms. (51 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 337434 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 19
Probabilistic random walk after 337434 steps, saw 53671 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-06-01 04:42:07] [INFO ] Invariant cache hit.
[2024-06-01 04:42:07] [INFO ] State equation strengthened by 243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 538/598 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 242/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 5/603 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 317 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 538/598 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 242/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 5/603 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/603 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 336 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4374 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5802ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 6441 ms.
Support contains 24 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 540/540 transitions.
Applied a total of 0 rules in 31 ms. Remains 63 /63 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 63/63 places, 540/540 transitions.
RANDOM walk for 40000 steps (1117 resets) in 684 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (14 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 359661 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 19
Probabilistic random walk after 359661 steps, saw 56101 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2024-06-01 04:42:23] [INFO ] Invariant cache hit.
[2024-06-01 04:42:23] [INFO ] State equation strengthened by 243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 538/598 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 242/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 5/603 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 317 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 36/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 538/598 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 242/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 5/603 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/603 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 336 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3770 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5069ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 5950 ms.
Support contains 24 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 540/540 transitions.
Applied a total of 0 rules in 28 ms. Remains 63 /63 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 63/63 places, 540/540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 540/540 transitions.
Applied a total of 0 rules in 27 ms. Remains 63 /63 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2024-06-01 04:42:34] [INFO ] Invariant cache hit.
[2024-06-01 04:42:34] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 04:42:34] [INFO ] Invariant cache hit.
[2024-06-01 04:42:34] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-06-01 04:42:34] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-06-01 04:42:34] [INFO ] Redundant transitions in 38 ms returned []
Running 539 sub problems to find dead transitions.
[2024-06-01 04:42:34] [INFO ] Invariant cache hit.
[2024-06-01 04:42:34] [INFO ] State equation strengthened by 243 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 539 unsolved
[2024-06-01 04:42:45] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Problem TDEAD294 is UNSAT
At refinement iteration 4 (OVERLAPS) 540/603 variables, 63/75 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 243/318 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 7 (OVERLAPS) 0/603 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 538 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 318 constraints, problems are : Problem set: 1 solved, 538 unsolved in 27312 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 4 (OVERLAPS) 540/603 variables, 63/75 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 243/318 constraints. Problems are: Problem set: 1 solved, 538 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 538/856 constraints. Problems are: Problem set: 1 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 856 constraints, problems are : Problem set: 1 solved, 538 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 538/539 constraints, Known Traps: 1/1 constraints]
After SMT, in 63641ms problems are : Problem set: 1 solved, 538 unsolved
Search for dead transitions found 1 dead transitions in 63647ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/63 places, 539/540 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 63 transition count 538
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 62 transition count 538
Applied a total of 2 rules in 38 ms. Remains 62 /63 variables (removed 1) and now considering 538/539 (removed 1) transitions.
// Phase 1: matrix 538 rows 62 cols
[2024-06-01 04:43:38] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 04:43:38] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 04:43:38] [INFO ] Invariant cache hit.
[2024-06-01 04:43:38] [INFO ] State equation strengthened by 242 read => feed constraints.
[2024-06-01 04:43:39] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 62/63 places, 538/540 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64887 ms. Remains : 62/63 places, 538/540 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-06-01 04:43:39] [INFO ] Flatten gal took : 77 ms
[2024-06-01 04:43:39] [INFO ] Flatten gal took : 82 ms
[2024-06-01 04:43:39] [INFO ] Input system was already deterministic with 573 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 77 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 546
Applied a total of 6 rules in 7 ms. Remains 77 /80 variables (removed 3) and now considering 546/573 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 77/80 places, 546/573 transitions.
[2024-06-01 04:43:39] [INFO ] Flatten gal took : 59 ms
[2024-06-01 04:43:39] [INFO ] Flatten gal took : 63 ms
[2024-06-01 04:43:39] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 528
Applied a total of 10 rules in 6 ms. Remains 75 /80 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 75/80 places, 528/573 transitions.
[2024-06-01 04:43:39] [INFO ] Flatten gal took : 48 ms
[2024-06-01 04:43:39] [INFO ] Flatten gal took : 51 ms
[2024-06-01 04:43:40] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 537
Applied a total of 8 rules in 6 ms. Remains 76 /80 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 76/80 places, 537/573 transitions.
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 48 ms
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 49 ms
[2024-06-01 04:43:40] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 501
Applied a total of 16 rules in 5 ms. Remains 72 /80 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 72/80 places, 501/573 transitions.
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 43 ms
[2024-06-01 04:43:40] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 528
Applied a total of 10 rules in 5 ms. Remains 75 /80 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 75/80 places, 528/573 transitions.
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 41 ms
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 43 ms
[2024-06-01 04:43:40] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 510
Applied a total of 14 rules in 4 ms. Remains 73 /80 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 73/80 places, 510/573 transitions.
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:43:40] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:43:40] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 519
Applied a total of 12 rules in 5 ms. Remains 74 /80 variables (removed 6) and now considering 519/573 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 74/80 places, 519/573 transitions.
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 41 ms
[2024-06-01 04:43:41] [INFO ] Input system was already deterministic with 519 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 567
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 74 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 74 transition count 566
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 73 transition count 566
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 67 transition count 512
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 67 transition count 512
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 2 with 2 rules applied. Total rules applied 28 place count 66 transition count 511
Applied a total of 28 rules in 118 ms. Remains 66 /80 variables (removed 14) and now considering 511/573 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 120 ms. Remains : 66/80 places, 511/573 transitions.
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 40 ms
[2024-06-01 04:43:41] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 519
Applied a total of 12 rules in 5 ms. Remains 74 /80 variables (removed 6) and now considering 519/573 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 74/80 places, 519/573 transitions.
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 40 ms
[2024-06-01 04:43:41] [INFO ] Input system was already deterministic with 519 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 510
Applied a total of 14 rules in 6 ms. Remains 73 /80 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 73/80 places, 510/573 transitions.
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:43:41] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 566
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 73 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 72 transition count 565
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 72 transition count 564
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 71 transition count 564
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 26 place count 63 transition count 492
Iterating global reduction 3 with 8 rules applied. Total rules applied 34 place count 63 transition count 492
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 3 with 2 rules applied. Total rules applied 36 place count 62 transition count 491
Applied a total of 36 rules in 60 ms. Remains 62 /80 variables (removed 18) and now considering 491/573 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 62/80 places, 491/573 transitions.
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:43:41] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:43:41] [INFO ] Input system was already deterministic with 491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 501
Applied a total of 16 rules in 6 ms. Remains 72 /80 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 72/80 places, 501/573 transitions.
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 41 ms
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 45 ms
[2024-06-01 04:43:42] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 537
Applied a total of 8 rules in 5 ms. Remains 76 /80 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 76/80 places, 537/573 transitions.
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:43:42] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 537
Applied a total of 8 rules in 6 ms. Remains 76 /80 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 76/80 places, 537/573 transitions.
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 39 ms
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:43:42] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 77 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 546
Applied a total of 6 rules in 4 ms. Remains 77 /80 variables (removed 3) and now considering 546/573 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 77/80 places, 546/573 transitions.
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 40 ms
[2024-06-01 04:43:42] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 573/573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 78 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 78 transition count 555
Applied a total of 4 rules in 4 ms. Remains 78 /80 variables (removed 2) and now considering 555/573 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 78/80 places, 555/573 transitions.
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 36 ms
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:43:42] [INFO ] Input system was already deterministic with 555 transitions.
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:43:42] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:43:43] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2024-06-01 04:43:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 573 transitions and 6806 arcs took 17 ms.
Total runtime 242986 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-08a-CTLFireability-2023-15

BK_STOP 1717217023567

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/649/ctl_0_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/649/ctl_1_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/649/ctl_2_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/649/ctl_3_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/649/ctl_4_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/649/ctl_5_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/649/ctl_6_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/649/ctl_7_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/649/ctl_8_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/649/ctl_9_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/649/ctl_10_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/649/ctl_11_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/649/ctl_12_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/649/ctl_13_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/649/ctl_14_
ctl formula name AutonomousCar-PT-08a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/649/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-08a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-08a, 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 r468-smll-171620167500330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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