About the Execution of LTSMin+red for AutonomousCar-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3396.796 | 202568.00 | 303002.00 | 674.40 | ????????T?T????? | normal |
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-171620167600370.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-10b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167600370
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K 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 1.6M 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-10b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-10b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717226002934
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-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:26] [INFO ] Load time of PNML (sax parser for PT used): 675 ms
[2024-06-01 07:13:26] [INFO ] Transformed 425 places.
[2024-06-01 07:13:26] [INFO ] Transformed 2252 transitions.
[2024-06-01 07:13:26] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:26] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 942 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 87 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 367 transition count 2194
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 367 transition count 2194
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 516 place count 367 transition count 1794
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 526 place count 357 transition count 1784
Iterating global reduction 1 with 10 rules applied. Total rules applied 536 place count 357 transition count 1784
Applied a total of 536 rules in 192 ms. Remains 357 /425 variables (removed 68) and now considering 1784/2252 (removed 468) transitions.
// Phase 1: matrix 1784 rows 357 cols
[2024-06-01 07:13:27] [INFO ] Computed 15 invariants in 60 ms
[2024-06-01 07:13:27] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-06-01 07:13:27] [INFO ] Invariant cache hit.
[2024-06-01 07:13:28] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
Running 1783 sub problems to find dead transitions.
[2024-06-01 07:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1783 unsolved
SMT process timed out in 57372ms, After SMT, problems are : Problem set: 0 solved, 1783 unsolved
Search for dead transitions found 0 dead transitions in 57500ms
Starting structural reductions in LTL mode, iteration 1 : 357/425 places, 1784/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59633 ms. Remains : 357/425 places, 1784/2252 transitions.
Support contains 87 out of 357 places after structural reductions.
[2024-06-01 07:14:27] [INFO ] Flatten gal took : 500 ms
[2024-06-01 07:14:27] [INFO ] Flatten gal took : 297 ms
[2024-06-01 07:14:28] [INFO ] Input system was already deterministic with 1784 transitions.
Reduction of identical properties reduced properties to check from 71 to 70
RANDOM walk for 40000 steps (307 resets) in 4014 ms. (9 steps per ms) remains 52/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 251 ms. (15 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
[2024-06-01 07:14:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 289/357 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 50 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 3 (OVERLAPS) 1784/2141 variables, 357/372 constraints. Problems are: Problem set: 3 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2141 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2141/2141 variables, and 372 constraints, problems are : Problem set: 3 solved, 49 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 52/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 49 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 296/357 variables, 15/15 constraints. Problems are: Problem set: 4 solved, 48 unsolved
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 5 places in 1048 ms of which 48 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 15 places in 1032 ms of which 5 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 28 places in 847 ms of which 4 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 24 places in 830 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 18 places in 1144 ms of which 9 ms to minimize.
SMT process timed out in 11779ms, After SMT, problems are : Problem set: 4 solved, 48 unsolved
Fused 48 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Graph (trivial) has 261 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1872 edges and 355 vertex of which 353 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.59 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 353 transition count 1664
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 163 rules applied. Total rules applied 281 place count 238 transition count 1616
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 30 rules applied. Total rules applied 311 place count 210 transition count 1614
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 317 place count 208 transition count 1610
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 319 place count 206 transition count 1610
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 319 place count 206 transition count 1605
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 329 place count 201 transition count 1605
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 332 place count 198 transition count 1602
Iterating global reduction 5 with 3 rules applied. Total rules applied 335 place count 198 transition count 1602
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 445 place count 143 transition count 1546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 446 place count 143 transition count 1545
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 448 place count 141 transition count 1525
Iterating global reduction 6 with 2 rules applied. Total rules applied 450 place count 141 transition count 1525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 452 place count 141 transition count 1523
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 454 place count 140 transition count 1522
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 455 place count 140 transition count 1521
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 483 place count 140 transition count 1493
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 511 place count 112 transition count 1493
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 515 place count 112 transition count 1493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 516 place count 111 transition count 1492
Applied a total of 516 rules in 1072 ms. Remains 111 /357 variables (removed 246) and now considering 1492/1784 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1073 ms. Remains : 111/357 places, 1492/1784 transitions.
RANDOM walk for 40000 steps (1205 resets) in 2503 ms. (15 steps per ms) remains 40/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
// Phase 1: matrix 1492 rows 111 cols
[2024-06-01 07:14:44] [INFO ] Computed 14 invariants in 27 ms
[2024-06-01 07:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 49/102 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1486/1588 variables, 102/115 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1588 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 14/1602 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1602 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/1603 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1603 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1603 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/1603 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 126 constraints, problems are : Problem set: 0 solved, 39 unsolved in 7923 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 49/102 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 10 places in 1100 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 11 places in 918 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 8 places in 752 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1486/1588 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1588 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 14/1602 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/1603 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1603 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1603 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/1603 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1603/1603 variables, and 129 constraints, problems are : Problem set: 0 solved, 39 unsolved in 16024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 25282ms problems are : Problem set: 0 solved, 39 unsolved
Parikh walk visited 0 properties in 7218 ms.
Support contains 53 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 1492/1492 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 111 transition count 1491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 1491
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 110 transition count 1489
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 108 transition count 1489
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 8 place count 107 transition count 1488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 106 transition count 1487
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 106 transition count 1487
Applied a total of 10 rules in 158 ms. Remains 106 /111 variables (removed 5) and now considering 1487/1492 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 106/111 places, 1487/1492 transitions.
RANDOM walk for 40000 steps (1202 resets) in 1308 ms. (30 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
Interrupted probabilistic random walk after 187999 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 38
Probabilistic random walk after 187999 steps, saw 29482 distinct states, run finished after 3016 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1487 rows 106 cols
[2024-06-01 07:15:21] [INFO ] Computed 14 invariants in 15 ms
[2024-06-01 07:15:21] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 47/100 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1483/1583 variables, 100/113 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1583 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 10/1593 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1593 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/1593 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1593/1593 variables, and 121 constraints, problems are : Problem set: 0 solved, 38 unsolved in 4454 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 47/100 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 8 places in 959 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 8 places in 919 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1483/1583 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1583 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 10/1593 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/1593 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1593/1593 variables, and 123 constraints, problems are : Problem set: 0 solved, 38 unsolved in 11240 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 16446ms problems are : Problem set: 0 solved, 38 unsolved
Parikh walk visited 3 properties in 5603 ms.
Support contains 53 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 1487/1487 transitions.
Applied a total of 0 rules in 89 ms. Remains 106 /106 variables (removed 0) and now considering 1487/1487 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 106/106 places, 1487/1487 transitions.
RANDOM walk for 40000 steps (1187 resets) in 1563 ms. (25 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 245825 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 33
Probabilistic random walk after 245825 steps, saw 36412 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-01 07:15:46] [INFO ] Invariant cache hit.
[2024-06-01 07:15:47] [INFO ] State equation strengthened by 1 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, 33 unsolved
At refinement iteration 1 (OVERLAPS) 48/100 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 1483/1583 variables, 100/113 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1583 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 10/1593 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1593 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/1593 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1593/1593 variables, and 121 constraints, problems are : Problem set: 0 solved, 33 unsolved in 3029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 48/100 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 10 places in 705 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 8 places in 714 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 11 places in 810 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1483/1583 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1583 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 10/1593 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/1593 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1593/1593 variables, and 124 constraints, problems are : Problem set: 0 solved, 33 unsolved in 7872 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 11580ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 5294 ms.
Support contains 52 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 1487/1487 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 1486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 1486
Applied a total of 2 rules in 252 ms. Remains 105 /106 variables (removed 1) and now considering 1486/1487 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 105/106 places, 1486/1487 transitions.
RANDOM walk for 40000 steps (1192 resets) in 1179 ms. (33 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 278607 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :2 out of 32
Probabilistic random walk after 278607 steps, saw 40446 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :2
// Phase 1: matrix 1486 rows 105 cols
[2024-06-01 07:16:07] [INFO ] Computed 14 invariants in 13 ms
[2024-06-01 07:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 50/99 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1482/1581 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1581 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 10/1591 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1591 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1591 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1591 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/1591 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1591/1591 variables, and 120 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3162 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 50/99 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1482/1581 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1581 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 10/1591 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1591 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1591 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1591 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/1591 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1591/1591 variables, and 120 constraints, problems are : Problem set: 0 solved, 30 unsolved in 6126 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10025ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 4463 ms.
Support contains 49 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 1486/1486 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 1484
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 103 transition count 1474
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 103 transition count 1474
Applied a total of 15 rules in 264 ms. Remains 103 /105 variables (removed 2) and now considering 1474/1486 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 103/105 places, 1474/1486 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:16:22] [INFO ] Flatten gal took : 177 ms
[2024-06-01 07:16:22] [INFO ] Flatten gal took : 201 ms
[2024-06-01 07:16:23] [INFO ] Input system was already deterministic with 1784 transitions.
Support contains 77 out of 357 places (down from 78) after GAL structural reductions.
Computed a total of 53 stabilizing places and 54 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 348 transition count 1775
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 347 transition count 1774
Applied a total of 20 rules in 33 ms. Remains 347 /357 variables (removed 10) and now considering 1774/1784 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 347/357 places, 1774/1784 transitions.
[2024-06-01 07:16:23] [INFO ] Flatten gal took : 180 ms
[2024-06-01 07:16:24] [INFO ] Flatten gal took : 179 ms
[2024-06-01 07:16:24] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 350 transition count 1777
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 350 transition count 1777
Applied a total of 14 rules in 25 ms. Remains 350 /357 variables (removed 7) and now considering 1777/1784 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 350/357 places, 1777/1784 transitions.
[2024-06-01 07:16:24] [INFO ] Flatten gal took : 145 ms
[2024-06-01 07:16:24] [INFO ] Flatten gal took : 154 ms
[2024-06-01 07:16:25] [INFO ] Input system was already deterministic with 1777 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 348 transition count 1775
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 347 transition count 1774
Applied a total of 20 rules in 31 ms. Remains 347 /357 variables (removed 10) and now considering 1774/1784 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 347/357 places, 1774/1784 transitions.
[2024-06-01 07:16:25] [INFO ] Flatten gal took : 139 ms
[2024-06-01 07:16:25] [INFO ] Flatten gal took : 149 ms
[2024-06-01 07:16:25] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Graph (trivial) has 294 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 354 transition count 1653
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 183 rules applied. Total rules applied 312 place count 226 transition count 1598
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 35 rules applied. Total rules applied 347 place count 193 transition count 1596
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 351 place count 191 transition count 1594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 190 transition count 1594
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 352 place count 190 transition count 1589
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 362 place count 185 transition count 1589
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 367 place count 180 transition count 1584
Iterating global reduction 5 with 5 rules applied. Total rules applied 372 place count 180 transition count 1584
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 470 place count 131 transition count 1535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 471 place count 131 transition count 1534
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 482 place count 120 transition count 1430
Iterating global reduction 6 with 11 rules applied. Total rules applied 493 place count 120 transition count 1430
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 14 rules applied. Total rules applied 507 place count 120 transition count 1416
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 514 place count 113 transition count 1416
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 8 with 2 rules applied. Total rules applied 516 place count 112 transition count 1415
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 517 place count 112 transition count 1414
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 518 place count 112 transition count 1414
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 520 place count 110 transition count 1412
Applied a total of 520 rules in 657 ms. Remains 110 /357 variables (removed 247) and now considering 1412/1784 (removed 372) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 658 ms. Remains : 110/357 places, 1412/1784 transitions.
[2024-06-01 07:16:26] [INFO ] Flatten gal took : 208 ms
[2024-06-01 07:16:26] [INFO ] Flatten gal took : 202 ms
[2024-06-01 07:16:27] [INFO ] Input system was already deterministic with 1412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 349 transition count 1776
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 348 transition count 1775
Applied a total of 18 rules in 42 ms. Remains 348 /357 variables (removed 9) and now considering 1775/1784 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 348/357 places, 1775/1784 transitions.
[2024-06-01 07:16:27] [INFO ] Flatten gal took : 142 ms
[2024-06-01 07:16:27] [INFO ] Flatten gal took : 196 ms
[2024-06-01 07:16:27] [INFO ] Input system was already deterministic with 1775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 348 transition count 1775
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 347 transition count 1774
Applied a total of 20 rules in 47 ms. Remains 347 /357 variables (removed 10) and now considering 1774/1784 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 347/357 places, 1774/1784 transitions.
[2024-06-01 07:16:28] [INFO ] Flatten gal took : 141 ms
[2024-06-01 07:16:28] [INFO ] Flatten gal took : 147 ms
[2024-06-01 07:16:28] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Graph (trivial) has 306 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 354 transition count 1651
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 183 rules applied. Total rules applied 314 place count 224 transition count 1598
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 346 place count 193 transition count 1597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 347 place count 192 transition count 1597
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 347 place count 192 transition count 1591
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 359 place count 186 transition count 1591
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 364 place count 181 transition count 1586
Iterating global reduction 4 with 5 rules applied. Total rules applied 369 place count 181 transition count 1586
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 475 place count 128 transition count 1533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 476 place count 128 transition count 1532
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 489 place count 115 transition count 1408
Iterating global reduction 5 with 13 rules applied. Total rules applied 502 place count 115 transition count 1408
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 16 rules applied. Total rules applied 518 place count 115 transition count 1392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 526 place count 107 transition count 1392
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 7 with 2 rules applied. Total rules applied 528 place count 106 transition count 1391
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 106 transition count 1389
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 7 with 1 rules applied. Total rules applied 531 place count 106 transition count 1388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 532 place count 105 transition count 1388
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 534 place count 103 transition count 1386
Applied a total of 534 rules in 396 ms. Remains 103 /357 variables (removed 254) and now considering 1386/1784 (removed 398) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 397 ms. Remains : 103/357 places, 1386/1784 transitions.
[2024-06-01 07:16:29] [INFO ] Flatten gal took : 205 ms
[2024-06-01 07:16:29] [INFO ] Flatten gal took : 186 ms
[2024-06-01 07:16:29] [INFO ] Input system was already deterministic with 1386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 349 transition count 1776
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 348 transition count 1775
Applied a total of 18 rules in 39 ms. Remains 348 /357 variables (removed 9) and now considering 1775/1784 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 348/357 places, 1775/1784 transitions.
[2024-06-01 07:16:29] [INFO ] Flatten gal took : 169 ms
[2024-06-01 07:16:29] [INFO ] Flatten gal took : 143 ms
[2024-06-01 07:16:30] [INFO ] Input system was already deterministic with 1775 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Graph (trivial) has 338 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 354 transition count 1649
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 189 rules applied. Total rules applied 322 place count 222 transition count 1592
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 356 place count 188 transition count 1592
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 356 place count 188 transition count 1586
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 368 place count 182 transition count 1586
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 373 place count 177 transition count 1581
Iterating global reduction 3 with 5 rules applied. Total rules applied 378 place count 177 transition count 1581
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 512 place count 110 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 513 place count 110 transition count 1513
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 533 place count 90 transition count 1313
Iterating global reduction 4 with 20 rules applied. Total rules applied 553 place count 90 transition count 1313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 20 rules applied. Total rules applied 573 place count 90 transition count 1293
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 583 place count 80 transition count 1293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 585 place count 79 transition count 1292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 586 place count 79 transition count 1291
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 588 place count 77 transition count 1289
Applied a total of 588 rules in 542 ms. Remains 77 /357 variables (removed 280) and now considering 1289/1784 (removed 495) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 542 ms. Remains : 77/357 places, 1289/1784 transitions.
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 205 ms
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 214 ms
[2024-06-01 07:16:31] [INFO ] Input system was already deterministic with 1289 transitions.
RANDOM walk for 40000 steps (1941 resets) in 1507 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (121 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527511 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527511 steps, saw 86396 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 1289 rows 77 cols
[2024-06-01 07:16:34] [INFO ] Computed 14 invariants in 9 ms
[2024-06-01 07:16:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1252/1282 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1282 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/1365 variables, 47/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1365 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1365 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1366 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1366 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1366 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1366/1366 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1252/1282 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1282 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/1365 variables, 47/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1365 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1365 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1366 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1366 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1366 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1366/1366 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 1289/1289 transitions.
Graph (complete) has 1051 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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.
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 3 rules applied. Total rules applied 4 place count 76 transition count 1285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 75 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 75 transition count 1284
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 7 place count 74 transition count 1284
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 2 with 2 rules applied. Total rules applied 9 place count 73 transition count 1283
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 20 place count 73 transition count 1272
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 31 place count 62 transition count 1272
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 62 transition count 1272
Applied a total of 32 rules in 320 ms. Remains 62 /77 variables (removed 15) and now considering 1272/1289 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 62/77 places, 1272/1289 transitions.
RANDOM walk for 127937 steps (409 resets) in 3185 ms. (40 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-10b-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 349 transition count 1776
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 348 transition count 1775
Applied a total of 18 rules in 33 ms. Remains 348 /357 variables (removed 9) and now considering 1775/1784 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 348/357 places, 1775/1784 transitions.
[2024-06-01 07:16:38] [INFO ] Flatten gal took : 140 ms
[2024-06-01 07:16:38] [INFO ] Flatten gal took : 309 ms
[2024-06-01 07:16:39] [INFO ] Input system was already deterministic with 1775 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Graph (trivial) has 319 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 354 transition count 1648
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 190 rules applied. Total rules applied 324 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 358 place count 187 transition count 1591
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 358 place count 187 transition count 1585
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 370 place count 181 transition count 1585
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 375 place count 176 transition count 1580
Iterating global reduction 3 with 5 rules applied. Total rules applied 380 place count 176 transition count 1580
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 494 place count 119 transition count 1523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 119 transition count 1522
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 508 place count 106 transition count 1399
Iterating global reduction 4 with 13 rules applied. Total rules applied 521 place count 106 transition count 1399
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 20 rules applied. Total rules applied 541 place count 106 transition count 1379
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 551 place count 96 transition count 1379
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 6 with 2 rules applied. Total rules applied 553 place count 95 transition count 1378
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 554 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 556 place count 93 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 557 place count 92 transition count 1375
Applied a total of 557 rules in 532 ms. Remains 92 /357 variables (removed 265) and now considering 1375/1784 (removed 409) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 532 ms. Remains : 92/357 places, 1375/1784 transitions.
[2024-06-01 07:16:39] [INFO ] Flatten gal took : 186 ms
[2024-06-01 07:16:40] [INFO ] Flatten gal took : 193 ms
[2024-06-01 07:16:40] [INFO ] Input system was already deterministic with 1375 transitions.
RANDOM walk for 40000 steps (1616 resets) in 632 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34348 steps (118 resets) in 99 ms. (343 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-10b-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 348 transition count 1775
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 347 transition count 1774
Applied a total of 20 rules in 33 ms. Remains 347 /357 variables (removed 10) and now considering 1774/1784 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 347/357 places, 1774/1784 transitions.
[2024-06-01 07:16:40] [INFO ] Flatten gal took : 143 ms
[2024-06-01 07:16:41] [INFO ] Flatten gal took : 162 ms
[2024-06-01 07:16:41] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 348 transition count 1775
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 347 transition count 1774
Applied a total of 20 rules in 42 ms. Remains 347 /357 variables (removed 10) and now considering 1774/1784 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 347/357 places, 1774/1784 transitions.
[2024-06-01 07:16:41] [INFO ] Flatten gal took : 143 ms
[2024-06-01 07:16:41] [INFO ] Flatten gal took : 146 ms
[2024-06-01 07:16:42] [INFO ] Input system was already deterministic with 1774 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Graph (trivial) has 295 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 354 transition count 1649
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 189 rules applied. Total rules applied 322 place count 222 transition count 1592
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 356 place count 188 transition count 1592
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 356 place count 188 transition count 1587
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 366 place count 183 transition count 1587
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 371 place count 178 transition count 1582
Iterating global reduction 3 with 5 rules applied. Total rules applied 376 place count 178 transition count 1582
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 470 place count 131 transition count 1535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 471 place count 131 transition count 1534
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 480 place count 122 transition count 1453
Iterating global reduction 4 with 9 rules applied. Total rules applied 489 place count 122 transition count 1453
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 16 rules applied. Total rules applied 505 place count 122 transition count 1437
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 513 place count 114 transition count 1437
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 6 with 2 rules applied. Total rules applied 515 place count 113 transition count 1436
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 516 place count 113 transition count 1435
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 517 place count 113 transition count 1435
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 519 place count 111 transition count 1433
Applied a total of 519 rules in 461 ms. Remains 111 /357 variables (removed 246) and now considering 1433/1784 (removed 351) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 461 ms. Remains : 111/357 places, 1433/1784 transitions.
[2024-06-01 07:16:42] [INFO ] Flatten gal took : 198 ms
[2024-06-01 07:16:42] [INFO ] Flatten gal took : 196 ms
[2024-06-01 07:16:43] [INFO ] Input system was already deterministic with 1433 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 349 transition count 1776
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 348 transition count 1775
Applied a total of 18 rules in 30 ms. Remains 348 /357 variables (removed 9) and now considering 1775/1784 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 348/357 places, 1775/1784 transitions.
[2024-06-01 07:16:43] [INFO ] Flatten gal took : 137 ms
[2024-06-01 07:16:43] [INFO ] Flatten gal took : 150 ms
[2024-06-01 07:16:43] [INFO ] Input system was already deterministic with 1775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1784/1784 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 349 transition count 1776
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 348 transition count 1775
Applied a total of 18 rules in 35 ms. Remains 348 /357 variables (removed 9) and now considering 1775/1784 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 348/357 places, 1775/1784 transitions.
[2024-06-01 07:16:44] [INFO ] Flatten gal took : 165 ms
[2024-06-01 07:16:44] [INFO ] Flatten gal took : 166 ms
[2024-06-01 07:16:44] [INFO ] Input system was already deterministic with 1775 transitions.
[2024-06-01 07:16:44] [INFO ] Flatten gal took : 145 ms
[2024-06-01 07:16:44] [INFO ] Flatten gal took : 146 ms
[2024-06-01 07:16:45] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2024-06-01 07:16:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 357 places, 1784 transitions and 26480 arcs took 36 ms.
Total runtime 199487 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-10b-CTLFireability-2023-15
BK_STOP 1717226205502
--------------------
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-10b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/615/ctl_0_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/615/ctl_1_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/615/ctl_2_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/615/ctl_3_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/615/ctl_4_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/615/ctl_5_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/615/ctl_6_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/615/ctl_7_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/615/ctl_8_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/615/ctl_9_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/615/ctl_10_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/615/ctl_11_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/615/ctl_12_
ctl formula name AutonomousCar-PT-10b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/615/ctl_13_
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-10b"
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-10b, 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-171620167600370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10b.tgz
mv AutonomousCar-PT-10b 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 '
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 ;