MCC'2024- Execution of r468-smll-171620167500338

About the Execution of LTSMin+red for AutonomousCar-PT-08b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
5158.212	191553.00	290618.00	752.90	???F?F??????????	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-171620167500338.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-08b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 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 517K 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-08b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-08b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717218216217

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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:03:38] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2024-06-01 05:03:38] [INFO ] Transformed 357 places.
[2024-06-01 05:03:38] [INFO ] Transformed 1128 transitions.
[2024-06-01 05:03:38] [INFO ] Found NUPN structural information;
[2024-06-01 05:03:38] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 90 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 310 transition count 1081
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 310 transition count 1081
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 350 place count 310 transition count 825
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 358 place count 302 transition count 817
Iterating global reduction 1 with 8 rules applied. Total rules applied 366 place count 302 transition count 817
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 367 place count 301 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 368 place count 301 transition count 816
Applied a total of 368 rules in 150 ms. Remains 301 /357 variables (removed 56) and now considering 816/1128 (removed 312) transitions.
// Phase 1: matrix 816 rows 301 cols
[2024-06-01 05:03:39] [INFO ] Computed 13 invariants in 39 ms
[2024-06-01 05:03:39] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 05:03:39] [INFO ] Invariant cache hit.
[2024-06-01 05:03:40] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 815 sub problems to find dead transitions.
[2024-06-01 05:03:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-06-01 05:03:57] [INFO ] Deduced a trap composed of 20 places in 525 ms of which 39 ms to minimize.
[2024-06-01 05:03:58] [INFO ] Deduced a trap composed of 17 places in 551 ms of which 5 ms to minimize.
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 18 places in 469 ms of which 3 ms to minimize.
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 35 places in 482 ms of which 3 ms to minimize.
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 4 ms to minimize.
[2024-06-01 05:04:00] [INFO ] Deduced a trap composed of 39 places in 479 ms of which 5 ms to minimize.
[2024-06-01 05:04:00] [INFO ] Deduced a trap composed of 44 places in 417 ms of which 3 ms to minimize.
[2024-06-01 05:04:01] [INFO ] Deduced a trap composed of 47 places in 458 ms of which 3 ms to minimize.
[2024-06-01 05:04:01] [INFO ] Deduced a trap composed of 41 places in 443 ms of which 3 ms to minimize.
[2024-06-01 05:04:02] [INFO ] Deduced a trap composed of 52 places in 447 ms of which 4 ms to minimize.
[2024-06-01 05:04:02] [INFO ] Deduced a trap composed of 51 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:04:03] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 4 ms to minimize.
[2024-06-01 05:04:03] [INFO ] Deduced a trap composed of 24 places in 413 ms of which 3 ms to minimize.
[2024-06-01 05:04:04] [INFO ] Deduced a trap composed of 66 places in 450 ms of which 3 ms to minimize.
[2024-06-01 05:04:04] [INFO ] Deduced a trap composed of 68 places in 429 ms of which 3 ms to minimize.
[2024-06-01 05:04:05] [INFO ] Deduced a trap composed of 31 places in 467 ms of which 3 ms to minimize.
[2024-06-01 05:04:05] [INFO ] Deduced a trap composed of 24 places in 420 ms of which 3 ms to minimize.
[2024-06-01 05:04:06] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 3 ms to minimize.
[2024-06-01 05:04:06] [INFO ] Deduced a trap composed of 38 places in 345 ms of which 3 ms to minimize.
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-06-01 05:04:08] [INFO ] Deduced a trap composed of 44 places in 430 ms of which 3 ms to minimize.
[2024-06-01 05:04:08] [INFO ] Deduced a trap composed of 38 places in 475 ms of which 3 ms to minimize.
[2024-06-01 05:04:09] [INFO ] Deduced a trap composed of 52 places in 451 ms of which 4 ms to minimize.
[2024-06-01 05:04:09] [INFO ] Deduced a trap composed of 40 places in 455 ms of which 3 ms to minimize.
[2024-06-01 05:04:10] [INFO ] Deduced a trap composed of 43 places in 470 ms of which 3 ms to minimize.
[2024-06-01 05:04:10] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 3 ms to minimize.
[2024-06-01 05:04:11] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 3 ms to minimize.
[2024-06-01 05:04:11] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 3 ms to minimize.
[2024-06-01 05:04:11] [INFO ] Deduced a trap composed of 52 places in 343 ms of which 5 ms to minimize.
[2024-06-01 05:04:12] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 2 ms to minimize.
[2024-06-01 05:04:12] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 3 ms to minimize.
[2024-06-01 05:04:12] [INFO ] Deduced a trap composed of 45 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:04:13] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 3 ms to minimize.
[2024-06-01 05:04:13] [INFO ] Deduced a trap composed of 45 places in 338 ms of which 6 ms to minimize.
[2024-06-01 05:04:13] [INFO ] Deduced a trap composed of 48 places in 348 ms of which 3 ms to minimize.
[2024-06-01 05:04:14] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 4 ms to minimize.
[2024-06-01 05:04:14] [INFO ] Deduced a trap composed of 48 places in 339 ms of which 2 ms to minimize.
[2024-06-01 05:04:15] [INFO ] Deduced a trap composed of 53 places in 323 ms of which 2 ms to minimize.
[2024-06-01 05:04:15] [INFO ] Deduced a trap composed of 48 places in 317 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/1117 variables, and 53 constraints, problems are : Problem set: 0 solved, 815 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 815/815 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 4 ms to minimize.
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 3 ms to minimize.
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 32 places in 344 ms of which 3 ms to minimize.
[2024-06-01 05:04:24] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 3 ms to minimize.
[2024-06-01 05:04:24] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 3 ms to minimize.
[2024-06-01 05:04:24] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-06-01 05:04:25] [INFO ] Deduced a trap composed of 14 places in 417 ms of which 3 ms to minimize.
[2024-06-01 05:04:26] [INFO ] Deduced a trap composed of 40 places in 443 ms of which 3 ms to minimize.
[2024-06-01 05:04:26] [INFO ] Deduced a trap composed of 47 places in 425 ms of which 3 ms to minimize.
[2024-06-01 05:04:27] [INFO ] Deduced a trap composed of 39 places in 374 ms of which 2 ms to minimize.
[2024-06-01 05:04:27] [INFO ] Deduced a trap composed of 43 places in 390 ms of which 3 ms to minimize.
[2024-06-01 05:04:28] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 3 ms to minimize.
[2024-06-01 05:04:28] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 2 ms to minimize.
[2024-06-01 05:04:28] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 2 ms to minimize.
[2024-06-01 05:04:28] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 2 ms to minimize.
[2024-06-01 05:04:29] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 2 ms to minimize.
[2024-06-01 05:04:29] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 3 ms to minimize.
[2024-06-01 05:04:29] [INFO ] Deduced a trap composed of 47 places in 409 ms of which 4 ms to minimize.
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 58 places in 388 ms of which 3 ms to minimize.
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-06-01 05:04:31] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 4 ms to minimize.
[2024-06-01 05:04:32] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 3 ms to minimize.
[2024-06-01 05:04:32] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 2 ms to minimize.
[2024-06-01 05:04:32] [INFO ] Deduced a trap composed of 46 places in 393 ms of which 3 ms to minimize.
[2024-06-01 05:04:33] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 3 ms to minimize.
[2024-06-01 05:04:33] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 3 ms to minimize.
[2024-06-01 05:04:34] [INFO ] Deduced a trap composed of 46 places in 359 ms of which 3 ms to minimize.
[2024-06-01 05:04:34] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 3 ms to minimize.
[2024-06-01 05:04:34] [INFO ] Deduced a trap composed of 46 places in 318 ms of which 3 ms to minimize.
[2024-06-01 05:04:35] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 2 ms to minimize.
[2024-06-01 05:04:35] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 3 ms to minimize.
[2024-06-01 05:04:36] [INFO ] Deduced a trap composed of 22 places in 335 ms of which 3 ms to minimize.
[2024-06-01 05:04:36] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 3 ms to minimize.
[2024-06-01 05:04:36] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 2 ms to minimize.
[2024-06-01 05:04:37] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 3 ms to minimize.
[2024-06-01 05:04:37] [INFO ] Deduced a trap composed of 32 places in 415 ms of which 3 ms to minimize.
[2024-06-01 05:04:38] [INFO ] Deduced a trap composed of 36 places in 374 ms of which 3 ms to minimize.
[2024-06-01 05:04:38] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 3 ms to minimize.
[2024-06-01 05:04:39] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 3 ms to minimize.
[2024-06-01 05:04:40] [INFO ] Deduced a trap composed of 32 places in 466 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-06-01 05:04:42] [INFO ] Deduced a trap composed of 33 places in 446 ms of which 2 ms to minimize.
[2024-06-01 05:04:43] [INFO ] Deduced a trap composed of 47 places in 346 ms of which 3 ms to minimize.
[2024-06-01 05:04:43] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 3 ms to minimize.
[2024-06-01 05:04:43] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 2 ms to minimize.
[2024-06-01 05:04:44] [INFO ] Deduced a trap composed of 43 places in 271 ms of which 3 ms to minimize.
[2024-06-01 05:04:44] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 2 ms to minimize.
[2024-06-01 05:04:44] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:04:45] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 3 ms to minimize.
[2024-06-01 05:04:45] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 2 ms to minimize.
[2024-06-01 05:04:46] [INFO ] Deduced a trap composed of 45 places in 346 ms of which 3 ms to minimize.
SMT process timed out in 66168ms, After SMT, problems are : Problem set: 0 solved, 815 unsolved
Search for dead transitions found 0 dead transitions in 66218ms
Starting structural reductions in LTL mode, iteration 1 : 301/357 places, 816/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67503 ms. Remains : 301/357 places, 816/1128 transitions.
Support contains 90 out of 301 places after structural reductions.
[2024-06-01 05:04:46] [INFO ] Flatten gal took : 225 ms
[2024-06-01 05:04:47] [INFO ] Flatten gal took : 125 ms
[2024-06-01 05:04:47] [INFO ] Input system was already deterministic with 816 transitions.
RANDOM walk for 40000 steps (236 resets) in 4393 ms. (9 steps per ms) remains 60/111 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
[2024-06-01 05:04:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp92 is UNSAT
At refinement iteration 1 (OVERLAPS) 222/282 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 57 unsolved
[2024-06-01 05:04:51] [INFO ] Deduced a trap composed of 45 places in 353 ms of which 3 ms to minimize.
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 19/301 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 56 unsolved
[2024-06-01 05:04:52] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:04:52] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 05:04:52] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 3/17 constraints. Problems are: Problem set: 4 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 816/1117 variables, 301/318 constraints. Problems are: Problem set: 4 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1117 variables, 0/318 constraints. Problems are: Problem set: 4 solved, 56 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1117/1117 variables, and 318 constraints, problems are : Problem set: 4 solved, 56 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 56 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 227/282 variables, 12/12 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 1/13 constraints. Problems are: Problem set: 6 solved, 54 unsolved
[2024-06-01 05:04:55] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 2 ms to minimize.
[2024-06-01 05:04:56] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 3 ms to minimize.
[2024-06-01 05:04:56] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 2 ms to minimize.
[2024-06-01 05:04:57] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 3 ms to minimize.
[2024-06-01 05:04:57] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 5/18 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/18 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 19/301 variables, 1/19 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 3/22 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 816/1117 variables, 301/323 constraints. Problems are: Problem set: 6 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1117/1117 variables, and 377 constraints, problems are : Problem set: 6 solved, 54 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 54/60 constraints, Known Traps: 9/9 constraints]
After SMT, in 10867ms problems are : Problem set: 6 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 816/816 transitions.
Graph (trivial) has 220 edges and 301 vertex of which 4 / 301 are part of one of the 2 SCC in 6 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 1328 edges and 299 vertex of which 297 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 100 rules applied. Total rules applied 102 place count 297 transition count 712
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 143 rules applied. Total rules applied 245 place count 199 transition count 667
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 28 rules applied. Total rules applied 273 place count 173 transition count 665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 275 place count 171 transition count 665
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 275 place count 171 transition count 656
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 293 place count 162 transition count 656
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 295 place count 160 transition count 654
Iterating global reduction 4 with 2 rules applied. Total rules applied 297 place count 160 transition count 654
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 367 place count 125 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 368 place count 125 transition count 618
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 369 place count 124 transition count 617
Iterating global reduction 5 with 1 rules applied. Total rules applied 370 place count 124 transition count 617
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 5 with 2 rules applied. Total rules applied 372 place count 123 transition count 616
Free-agglomeration rule applied 24 times.
Iterating global reduction 5 with 24 rules applied. Total rules applied 396 place count 123 transition count 592
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 420 place count 99 transition count 592
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 421 place count 99 transition count 591
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 425 place count 99 transition count 591
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 426 place count 98 transition count 590
Applied a total of 426 rules in 368 ms. Remains 98 /301 variables (removed 203) and now considering 590/816 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 98/301 places, 590/816 transitions.
RANDOM walk for 40000 steps (1161 resets) in 1245 ms. (32 steps per ms) remains 51/54 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (12 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
// Phase 1: matrix 590 rows 98 cols
[2024-06-01 05:05:01] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 05:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 47/95 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 3/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 590/688 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/688 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 112 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 98/98 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 47/95 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 05:05:03] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2024-06-01 05:05:04] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2024-06-01 05:05:04] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2024-06-01 05:05:04] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 2 ms to minimize.
[2024-06-01 05:05:04] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 2 ms to minimize.
[2024-06-01 05:05:05] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 3/98 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 05:05:05] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 590/688 variables, 98/118 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/688 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 688/688 variables, and 155 constraints, problems are : Problem set: 0 solved, 36 unsolved in 11010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 98/98 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 7/7 constraints]
After SMT, in 13009ms problems are : Problem set: 0 solved, 36 unsolved
Parikh walk visited 7 properties in 32007 ms.
Support contains 43 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 590/590 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 93 transition count 585
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 93 transition count 582
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 24 place count 90 transition count 574
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 88 transition count 572
Applied a total of 26 rules in 80 ms. Remains 88 /98 variables (removed 10) and now considering 572/590 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 88/98 places, 572/590 transitions.
RANDOM walk for 40000 steps (1307 resets) in 721 ms. (55 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (11 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
// Phase 1: matrix 572 rows 88 cols
[2024-06-01 05:05:47] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 42/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 572/660 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/660 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 102 constraints, problems are : Problem set: 0 solved, 23 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 42/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 05:05:48] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 05:05:48] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 572/660 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 23/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 05:05:52] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2024-06-01 05:05:53] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/660 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/660 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 05:05:57] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/660 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 0/660 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 130 constraints, problems are : Problem set: 0 solved, 23 unsolved in 15449 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 5/5 constraints]
After SMT, in 16641ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 6428 ms.
Support contains 43 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 572/572 transitions.
Applied a total of 0 rules in 32 ms. Remains 88 /88 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 88/88 places, 572/572 transitions.
RANDOM walk for 40000 steps (1296 resets) in 625 ms. (63 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
[2024-06-01 05:06:10] [INFO ] Invariant cache hit.
[2024-06-01 05:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 43/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 05:06:11] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 572/660 variables, 88/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/660 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 103 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 43/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 572/660 variables, 88/105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/660 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 126 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5430 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 88/88 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 4/4 constraints]
After SMT, in 6658ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 3796 ms.
Support contains 42 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 572/572 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 571
Applied a total of 2 rules in 30 ms. Remains 87 /88 variables (removed 1) and now considering 571/572 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 87/88 places, 571/572 transitions.
RANDOM walk for 40000 steps (1356 resets) in 511 ms. (78 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 355602 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :3 out of 19
Probabilistic random walk after 355602 steps, saw 57845 distinct states, run finished after 3011 ms. (steps per millisecond=118 ) properties seen :3
// Phase 1: matrix 571 rows 87 cols
[2024-06-01 05:06:24] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 43/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 05:06:24] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 571/658 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/658 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 102 constraints, problems are : Problem set: 0 solved, 16 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 43/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 05:06:25] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2024-06-01 05:06:25] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2024-06-01 05:06:26] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 3/87 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 571/658 variables, 87/104 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 16/121 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 05:06:27] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 05:06:30] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/658 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/658 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/658 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 123 constraints, problems are : Problem set: 0 solved, 16 unsolved in 8996 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 6/6 constraints]
After SMT, in 10022ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 8416 ms.
Support contains 41 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 571/571 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 570
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 86 transition count 562
Applied a total of 10 rules in 41 ms. Remains 86 /87 variables (removed 1) and now considering 562/571 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 86/87 places, 562/571 transitions.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08b-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:06:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:06:42] [INFO ] Flatten gal took : 74 ms
FORMULA AutonomousCar-PT-08b-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:06:42] [INFO ] Flatten gal took : 76 ms
[2024-06-01 05:06:43] [INFO ] Input system was already deterministic with 816 transitions.
Support contains 76 out of 301 places (down from 77) after GAL structural reductions.
Computed a total of 50 stabilizing places and 51 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 66 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:43] [INFO ] Flatten gal took : 63 ms
[2024-06-01 05:06:43] [INFO ] Flatten gal took : 69 ms
[2024-06-01 05:06:43] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 293 transition count 808
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 292 transition count 807
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 292 transition count 807
Applied a total of 18 rules in 17 ms. Remains 292 /301 variables (removed 9) and now considering 807/816 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 292/301 places, 807/816 transitions.
[2024-06-01 05:06:43] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:06:43] [INFO ] Flatten gal took : 68 ms
[2024-06-01 05:06:43] [INFO ] Input system was already deterministic with 807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 15 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:43] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 65 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 17 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 58 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 59 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 293 transition count 808
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 292 transition count 807
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 292 transition count 807
Applied a total of 18 rules in 16 ms. Remains 292 /301 variables (removed 9) and now considering 807/816 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 292/301 places, 807/816 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 48 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 56 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 293 transition count 808
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 292 transition count 807
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 292 transition count 807
Applied a total of 18 rules in 15 ms. Remains 292 /301 variables (removed 9) and now considering 807/816 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 292/301 places, 807/816 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 44 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 54 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 293 transition count 808
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 292 transition count 807
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 292 transition count 807
Applied a total of 18 rules in 15 ms. Remains 292 /301 variables (removed 9) and now considering 807/816 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 292/301 places, 807/816 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 41 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 48 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 807 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Graph (trivial) has 261 edges and 301 vertex of which 4 / 301 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 298 transition count 703
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 156 rules applied. Total rules applied 267 place count 188 transition count 657
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 294 place count 161 transition count 657
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 294 place count 161 transition count 651
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 306 place count 155 transition count 651
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 312 place count 149 transition count 645
Iterating global reduction 3 with 6 rules applied. Total rules applied 318 place count 149 transition count 645
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 408 place count 104 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 409 place count 104 transition count 599
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 417 place count 96 transition count 541
Iterating global reduction 4 with 8 rules applied. Total rules applied 425 place count 96 transition count 541
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 437 place count 96 transition count 529
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 443 place count 90 transition count 529
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 445 place count 89 transition count 528
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 446 place count 89 transition count 527
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 447 place count 89 transition count 527
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 449 place count 87 transition count 525
Applied a total of 449 rules in 361 ms. Remains 87 /301 variables (removed 214) and now considering 525/816 (removed 291) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 362 ms. Remains : 87/301 places, 525/816 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 48 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 294 transition count 809
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 294 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 293 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 293 transition count 808
Applied a total of 16 rules in 24 ms. Remains 293 /301 variables (removed 8) and now considering 808/816 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 293/301 places, 808/816 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 41 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 45 ms
[2024-06-01 05:06:46] [INFO ] Input system was already deterministic with 808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 23 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 41 ms
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 47 ms
[2024-06-01 05:06:46] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 24 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 44 ms
[2024-06-01 05:06:46] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 21 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 44 ms
[2024-06-01 05:06:46] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 19 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:06:46] [INFO ] Flatten gal took : 44 ms
[2024-06-01 05:06:46] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 816/816 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 292 transition count 807
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 291 transition count 806
Applied a total of 20 rules in 18 ms. Remains 291 /301 variables (removed 10) and now considering 806/816 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 291/301 places, 806/816 transitions.
[2024-06-01 05:06:47] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:06:47] [INFO ] Flatten gal took : 43 ms
[2024-06-01 05:06:47] [INFO ] Input system was already deterministic with 806 transitions.
[2024-06-01 05:06:47] [INFO ] Flatten gal took : 45 ms
[2024-06-01 05:06:47] [INFO ] Flatten gal took : 46 ms
[2024-06-01 05:06:47] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2024-06-01 05:06:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 301 places, 816 transitions and 7294 arcs took 12 ms.
Total runtime 189360 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-08b-CTLFireability-2023-15

BK_STOP 1717218407770

--------------------
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-08b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/928/ctl_0_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/928/ctl_1_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/928/ctl_2_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/928/ctl_3_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/928/ctl_4_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/928/ctl_5_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/928/ctl_6_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/928/ctl_7_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/928/ctl_8_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/928/ctl_9_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/928/ctl_10_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/928/ctl_11_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/928/ctl_12_
ctl formula name AutonomousCar-PT-08b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/928/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-08b"
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-08b, 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-171620167500338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;