About the Execution of LTSMin+red for EisenbergMcGuire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4686.247 | 299817.00 | 403210.00 | 1055.50 | ?T?????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266400194.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 EisenbergMcGuire-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400194
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-09-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717231516244
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:45:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:45:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:45:18] [INFO ] Load time of PNML (sax parser for PT used): 523 ms
[2024-06-01 08:45:18] [INFO ] Transformed 891 places.
[2024-06-01 08:45:18] [INFO ] Transformed 3888 transitions.
[2024-06-01 08:45:18] [INFO ] Found NUPN structural information;
[2024-06-01 08:45:18] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 766 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 106 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 828 transition count 3321
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 828 transition count 3321
Applied a total of 126 rules in 197 ms. Remains 828 /891 variables (removed 63) and now considering 3321/3888 (removed 567) transitions.
[2024-06-01 08:45:19] [INFO ] Flow matrix only has 1242 transitions (discarded 2079 similar events)
// Phase 1: matrix 1242 rows 828 cols
[2024-06-01 08:45:19] [INFO ] Computed 28 invariants in 31 ms
[2024-06-01 08:45:20] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-06-01 08:45:20] [INFO ] Flow matrix only has 1242 transitions (discarded 2079 similar events)
[2024-06-01 08:45:20] [INFO ] Invariant cache hit.
[2024-06-01 08:45:21] [INFO ] State equation strengthened by 428 read => feed constraints.
[2024-06-01 08:45:25] [INFO ] Implicit Places using invariants and state equation in 4648 ms returned []
Implicit Place search using SMT with State Equation took 5851 ms to find 0 implicit places.
Running 3312 sub problems to find dead transitions.
[2024-06-01 08:45:25] [INFO ] Flow matrix only has 1242 transitions (discarded 2079 similar events)
[2024-06-01 08:45:25] [INFO ] Invariant cache hit.
[2024-06-01 08:45:25] [INFO ] State equation strengthened by 428 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3312 unsolved
SMT process timed out in 33159ms, After SMT, problems are : Problem set: 0 solved, 3312 unsolved
Search for dead transitions found 0 dead transitions in 33245ms
Starting structural reductions in LTL mode, iteration 1 : 828/891 places, 3321/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39356 ms. Remains : 828/891 places, 3321/3888 transitions.
Support contains 106 out of 828 places after structural reductions.
[2024-06-01 08:45:59] [INFO ] Flatten gal took : 403 ms
[2024-06-01 08:45:59] [INFO ] Flatten gal took : 188 ms
[2024-06-01 08:45:59] [INFO ] Input system was already deterministic with 3321 transitions.
Support contains 104 out of 828 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4015 ms. (9 steps per ms) remains 62/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
[2024-06-01 08:46:01] [INFO ] Flow matrix only has 1242 transitions (discarded 2079 similar events)
[2024-06-01 08:46:01] [INFO ] Invariant cache hit.
[2024-06-01 08:46:01] [INFO ] State equation strengthened by 428 read => feed constraints.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp27 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 731/825 variables, 18/19 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/825 variables, 6/25 constraints. Problems are: Problem set: 3 solved, 59 unsolved
[2024-06-01 08:46:02] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 25 ms to minimize.
[2024-06-01 08:46:03] [INFO ] Deduced a trap composed of 3 places in 755 ms of which 9 ms to minimize.
[2024-06-01 08:46:04] [INFO ] Deduced a trap composed of 78 places in 785 ms of which 9 ms to minimize.
[2024-06-01 08:46:05] [INFO ] Deduced a trap composed of 33 places in 731 ms of which 8 ms to minimize.
[2024-06-01 08:46:05] [INFO ] Deduced a trap composed of 106 places in 418 ms of which 5 ms to minimize.
[2024-06-01 08:46:06] [INFO ] Deduced a trap composed of 50 places in 408 ms of which 5 ms to minimize.
[2024-06-01 08:46:06] [INFO ] Deduced a trap composed of 108 places in 337 ms of which 5 ms to minimize.
SMT process timed out in 5395ms, After SMT, problems are : Problem set: 3 solved, 59 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 828 transition count 3317
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 824 transition count 3317
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 242 Pre rules applied. Total rules applied 8 place count 824 transition count 3075
Deduced a syphon composed of 242 places in 3 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 2 with 484 rules applied. Total rules applied 492 place count 582 transition count 3075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 493 place count 581 transition count 3066
Iterating global reduction 2 with 1 rules applied. Total rules applied 494 place count 581 transition count 3066
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 638 place count 509 transition count 2994
Applied a total of 638 rules in 496 ms. Remains 509 /828 variables (removed 319) and now considering 2994/3321 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 509/828 places, 2994/3321 transitions.
RANDOM walk for 40000 steps (8 resets) in 986 ms. (40 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
Interrupted probabilistic random walk after 79500 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :11 out of 58
Probabilistic random walk after 79500 steps, saw 57164 distinct states, run finished after 3012 ms. (steps per millisecond=26 ) properties seen :11
[2024-06-01 08:46:11] [INFO ] Flow matrix only has 915 transitions (discarded 2079 similar events)
// Phase 1: matrix 915 rows 509 cols
[2024-06-01 08:46:11] [INFO ] Computed 28 invariants in 7 ms
[2024-06-01 08:46:11] [INFO ] State equation strengthened by 420 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 428/505 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:12] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:46:12] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 3 ms to minimize.
[2024-06-01 08:46:13] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 4 ms to minimize.
[2024-06-01 08:46:13] [INFO ] Deduced a trap composed of 123 places in 533 ms of which 5 ms to minimize.
[2024-06-01 08:46:14] [INFO ] Deduced a trap composed of 33 places in 540 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 4/509 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:15] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 5 ms to minimize.
[2024-06-01 08:46:16] [INFO ] Deduced a trap composed of 3 places in 547 ms of which 5 ms to minimize.
[2024-06-01 08:46:16] [INFO ] Deduced a trap composed of 20 places in 484 ms of which 5 ms to minimize.
[2024-06-01 08:46:17] [INFO ] Deduced a trap composed of 32 places in 496 ms of which 5 ms to minimize.
[2024-06-01 08:46:17] [INFO ] Deduced a trap composed of 30 places in 488 ms of which 5 ms to minimize.
[2024-06-01 08:46:18] [INFO ] Deduced a trap composed of 36 places in 492 ms of which 5 ms to minimize.
[2024-06-01 08:46:18] [INFO ] Deduced a trap composed of 117 places in 487 ms of which 5 ms to minimize.
[2024-06-01 08:46:19] [INFO ] Deduced a trap composed of 53 places in 492 ms of which 5 ms to minimize.
[2024-06-01 08:46:19] [INFO ] Deduced a trap composed of 15 places in 477 ms of which 5 ms to minimize.
[2024-06-01 08:46:20] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 4 ms to minimize.
[2024-06-01 08:46:20] [INFO ] Deduced a trap composed of 11 places in 519 ms of which 5 ms to minimize.
[2024-06-01 08:46:20] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:46:21] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-06-01 08:46:21] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 3 ms to minimize.
[2024-06-01 08:46:21] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2024-06-01 08:46:21] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:22] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 3 ms to minimize.
[2024-06-01 08:46:22] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 3 ms to minimize.
[2024-06-01 08:46:23] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 3 ms to minimize.
[2024-06-01 08:46:23] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:46:23] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 3 ms to minimize.
[2024-06-01 08:46:24] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 3 ms to minimize.
[2024-06-01 08:46:24] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:46:24] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:46:24] [INFO ] Deduced a trap composed of 56 places in 500 ms of which 5 ms to minimize.
[2024-06-01 08:46:25] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:46:25] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:46:25] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2024-06-01 08:46:25] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-06-01 08:46:25] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:26] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:27] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-01 08:46:27] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:46:27] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:28] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 21 places in 482 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 915/1424 variables, 509/580 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1424 variables, 420/1000 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1424 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 17 (OVERLAPS) 0/1424 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1424 variables, and 1000 constraints, problems are : Problem set: 0 solved, 47 unsolved in 23834 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 509/509 constraints, ReadFeed: 420/420 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 428/505 variables, 18/19 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 5/24 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 15/39 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-06-01 08:46:36] [INFO ] Deduced a trap composed of 149 places in 491 ms of which 5 ms to minimize.
[2024-06-01 08:46:36] [INFO ] Deduced a trap composed of 135 places in 548 ms of which 5 ms to minimize.
[2024-06-01 08:46:37] [INFO ] Deduced a trap composed of 164 places in 465 ms of which 5 ms to minimize.
[2024-06-01 08:46:37] [INFO ] Deduced a trap composed of 103 places in 530 ms of which 4 ms to minimize.
[2024-06-01 08:46:38] [INFO ] Deduced a trap composed of 108 places in 530 ms of which 5 ms to minimize.
[2024-06-01 08:46:39] [INFO ] Deduced a trap composed of 135 places in 531 ms of which 5 ms to minimize.
[2024-06-01 08:46:39] [INFO ] Deduced a trap composed of 94 places in 526 ms of which 6 ms to minimize.
[2024-06-01 08:46:40] [INFO ] Deduced a trap composed of 107 places in 631 ms of which 5 ms to minimize.
[2024-06-01 08:46:40] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 5 ms to minimize.
[2024-06-01 08:46:41] [INFO ] Deduced a trap composed of 96 places in 432 ms of which 5 ms to minimize.
[2024-06-01 08:46:41] [INFO ] Deduced a trap composed of 118 places in 487 ms of which 5 ms to minimize.
[2024-06-01 08:46:42] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 2 ms to minimize.
[2024-06-01 08:46:42] [INFO ] Deduced a trap composed of 66 places in 541 ms of which 5 ms to minimize.
[2024-06-01 08:46:43] [INFO ] Deduced a trap composed of 94 places in 568 ms of which 4 ms to minimize.
[2024-06-01 08:46:43] [INFO ] Deduced a trap composed of 59 places in 516 ms of which 5 ms to minimize.
[2024-06-01 08:46:44] [INFO ] Deduced a trap composed of 143 places in 509 ms of which 4 ms to minimize.
[2024-06-01 08:46:44] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:46:45] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:46:45] [INFO ] Deduced a trap composed of 63 places in 541 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 19/58 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-06-01 08:46:46] [INFO ] Deduced a trap composed of 133 places in 536 ms of which 5 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 75 places in 603 ms of which 5 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 123 places in 477 ms of which 4 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 104 places in 568 ms of which 4 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 137 places in 484 ms of which 5 ms to minimize.
[2024-06-01 08:46:49] [INFO ] Deduced a trap composed of 121 places in 480 ms of which 4 ms to minimize.
[2024-06-01 08:46:49] [INFO ] Deduced a trap composed of 117 places in 494 ms of which 5 ms to minimize.
[2024-06-01 08:46:50] [INFO ] Deduced a trap composed of 105 places in 586 ms of which 5 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 158 places in 599 ms of which 4 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 120 places in 475 ms of which 5 ms to minimize.
[2024-06-01 08:46:51] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 5 ms to minimize.
[2024-06-01 08:46:52] [INFO ] Deduced a trap composed of 103 places in 602 ms of which 5 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 115 places in 584 ms of which 5 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 114 places in 504 ms of which 6 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 108 places in 504 ms of which 5 ms to minimize.
[2024-06-01 08:46:54] [INFO ] Deduced a trap composed of 138 places in 375 ms of which 3 ms to minimize.
[2024-06-01 08:46:55] [INFO ] Deduced a trap composed of 112 places in 497 ms of which 4 ms to minimize.
[2024-06-01 08:46:55] [INFO ] Deduced a trap composed of 133 places in 518 ms of which 5 ms to minimize.
[2024-06-01 08:46:56] [INFO ] Deduced a trap composed of 104 places in 484 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/78 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-06-01 08:46:57] [INFO ] Deduced a trap composed of 156 places in 567 ms of which 5 ms to minimize.
[2024-06-01 08:46:57] [INFO ] Deduced a trap composed of 120 places in 485 ms of which 5 ms to minimize.
[2024-06-01 08:46:58] [INFO ] Deduced a trap composed of 88 places in 435 ms of which 4 ms to minimize.
[2024-06-01 08:46:58] [INFO ] Deduced a trap composed of 101 places in 445 ms of which 5 ms to minimize.
[2024-06-01 08:46:59] [INFO ] Deduced a trap composed of 61 places in 431 ms of which 5 ms to minimize.
[2024-06-01 08:46:59] [INFO ] Deduced a trap composed of 89 places in 379 ms of which 4 ms to minimize.
[2024-06-01 08:46:59] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:47:00] [INFO ] Deduced a trap composed of 103 places in 484 ms of which 5 ms to minimize.
[2024-06-01 08:47:00] [INFO ] Deduced a trap composed of 125 places in 460 ms of which 4 ms to minimize.
[2024-06-01 08:47:01] [INFO ] Deduced a trap composed of 103 places in 569 ms of which 4 ms to minimize.
[2024-06-01 08:47:01] [INFO ] Deduced a trap composed of 97 places in 487 ms of which 5 ms to minimize.
[2024-06-01 08:47:02] [INFO ] Deduced a trap composed of 71 places in 517 ms of which 5 ms to minimize.
[2024-06-01 08:47:03] [INFO ] Deduced a trap composed of 67 places in 493 ms of which 5 ms to minimize.
[2024-06-01 08:47:03] [INFO ] Deduced a trap composed of 125 places in 466 ms of which 5 ms to minimize.
[2024-06-01 08:47:04] [INFO ] Deduced a trap composed of 105 places in 471 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 15/93 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-06-01 08:47:05] [INFO ] Deduced a trap composed of 27 places in 469 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-06-01 08:47:06] [INFO ] Deduced a trap composed of 135 places in 486 ms of which 5 ms to minimize.
[2024-06-01 08:47:07] [INFO ] Deduced a trap composed of 69 places in 506 ms of which 5 ms to minimize.
[2024-06-01 08:47:08] [INFO ] Deduced a trap composed of 71 places in 471 ms of which 5 ms to minimize.
[2024-06-01 08:47:08] [INFO ] Deduced a trap composed of 135 places in 483 ms of which 4 ms to minimize.
[2024-06-01 08:47:09] [INFO ] Deduced a trap composed of 115 places in 400 ms of which 4 ms to minimize.
[2024-06-01 08:47:09] [INFO ] Deduced a trap composed of 99 places in 535 ms of which 4 ms to minimize.
[2024-06-01 08:47:10] [INFO ] Deduced a trap composed of 112 places in 642 ms of which 5 ms to minimize.
[2024-06-01 08:47:10] [INFO ] Deduced a trap composed of 76 places in 532 ms of which 5 ms to minimize.
[2024-06-01 08:47:11] [INFO ] Deduced a trap composed of 69 places in 479 ms of which 4 ms to minimize.
[2024-06-01 08:47:12] [INFO ] Deduced a trap composed of 141 places in 645 ms of which 4 ms to minimize.
[2024-06-01 08:47:12] [INFO ] Deduced a trap composed of 105 places in 492 ms of which 5 ms to minimize.
[2024-06-01 08:47:13] [INFO ] Deduced a trap composed of 84 places in 512 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 12/106 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-06-01 08:47:14] [INFO ] Deduced a trap composed of 59 places in 475 ms of which 4 ms to minimize.
[2024-06-01 08:47:15] [INFO ] Deduced a trap composed of 121 places in 579 ms of which 5 ms to minimize.
[2024-06-01 08:47:15] [INFO ] Deduced a trap composed of 86 places in 551 ms of which 5 ms to minimize.
[2024-06-01 08:47:16] [INFO ] Deduced a trap composed of 103 places in 560 ms of which 5 ms to minimize.
[2024-06-01 08:47:17] [INFO ] Deduced a trap composed of 116 places in 556 ms of which 5 ms to minimize.
[2024-06-01 08:47:17] [INFO ] Deduced a trap composed of 130 places in 496 ms of which 5 ms to minimize.
[2024-06-01 08:47:18] [INFO ] Deduced a trap composed of 118 places in 680 ms of which 5 ms to minimize.
[2024-06-01 08:47:18] [INFO ] Deduced a trap composed of 110 places in 698 ms of which 5 ms to minimize.
[2024-06-01 08:47:19] [INFO ] Deduced a trap composed of 119 places in 526 ms of which 4 ms to minimize.
[2024-06-01 08:47:19] [INFO ] Deduced a trap composed of 139 places in 489 ms of which 4 ms to minimize.
[2024-06-01 08:47:20] [INFO ] Deduced a trap composed of 116 places in 475 ms of which 4 ms to minimize.
SMT process timed out in 69232ms, After SMT, problems are : Problem set: 1 solved, 46 unsolved
Fused 46 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 73 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 2994/2994 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 509 transition count 2987
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 502 transition count 2987
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 499 transition count 2960
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 499 transition count 2960
Applied a total of 20 rules in 195 ms. Remains 499 /509 variables (removed 10) and now considering 2960/2994 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 499/509 places, 2960/2994 transitions.
RANDOM walk for 40000 steps (8 resets) in 1104 ms. (36 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
Interrupted probabilistic random walk after 86370 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :1 out of 46
Probabilistic random walk after 86370 steps, saw 60657 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :1
[2024-06-01 08:47:24] [INFO ] Flow matrix only has 881 transitions (discarded 2079 similar events)
// Phase 1: matrix 881 rows 499 cols
[2024-06-01 08:47:24] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 08:47:24] [INFO ] State equation strengthened by 396 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 423/495 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:25] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 3 ms to minimize.
[2024-06-01 08:47:25] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-06-01 08:47:26] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:26] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 4/499 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:28] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 3 ms to minimize.
[2024-06-01 08:47:28] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:29] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 4 ms to minimize.
[2024-06-01 08:47:29] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 881/1380 variables, 499/535 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1380 variables, 396/931 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:31] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1380 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1380 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:34] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-06-01 08:47:34] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1380 variables, 2/934 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1380 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (OVERLAPS) 0/1380 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1380/1380 variables, and 934 constraints, problems are : Problem set: 0 solved, 45 unsolved in 14187 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 499/499 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 423/495 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:39] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 2 ms to minimize.
[2024-06-01 08:47:39] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 2 ms to minimize.
[2024-06-01 08:47:40] [INFO ] Deduced a trap composed of 101 places in 524 ms of which 4 ms to minimize.
[2024-06-01 08:47:40] [INFO ] Deduced a trap composed of 112 places in 415 ms of which 4 ms to minimize.
[2024-06-01 08:47:41] [INFO ] Deduced a trap composed of 39 places in 434 ms of which 4 ms to minimize.
[2024-06-01 08:47:41] [INFO ] Deduced a trap composed of 88 places in 407 ms of which 4 ms to minimize.
[2024-06-01 08:47:41] [INFO ] Deduced a trap composed of 117 places in 475 ms of which 5 ms to minimize.
[2024-06-01 08:47:42] [INFO ] Deduced a trap composed of 97 places in 450 ms of which 4 ms to minimize.
[2024-06-01 08:47:42] [INFO ] Deduced a trap composed of 82 places in 405 ms of which 4 ms to minimize.
[2024-06-01 08:47:43] [INFO ] Deduced a trap composed of 28 places in 508 ms of which 5 ms to minimize.
[2024-06-01 08:47:43] [INFO ] Deduced a trap composed of 27 places in 466 ms of which 5 ms to minimize.
[2024-06-01 08:47:44] [INFO ] Deduced a trap composed of 19 places in 456 ms of which 4 ms to minimize.
[2024-06-01 08:47:44] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 08:47:44] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:47:45] [INFO ] Deduced a trap composed of 132 places in 471 ms of which 4 ms to minimize.
[2024-06-01 08:47:45] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 2 ms to minimize.
[2024-06-01 08:47:46] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:47:46] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:47:46] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:47] [INFO ] Deduced a trap composed of 56 places in 513 ms of which 5 ms to minimize.
[2024-06-01 08:47:47] [INFO ] Deduced a trap composed of 117 places in 495 ms of which 4 ms to minimize.
[2024-06-01 08:47:48] [INFO ] Deduced a trap composed of 128 places in 465 ms of which 4 ms to minimize.
[2024-06-01 08:47:48] [INFO ] Deduced a trap composed of 74 places in 486 ms of which 5 ms to minimize.
[2024-06-01 08:47:49] [INFO ] Deduced a trap composed of 136 places in 457 ms of which 4 ms to minimize.
[2024-06-01 08:47:49] [INFO ] Deduced a trap composed of 108 places in 456 ms of which 4 ms to minimize.
[2024-06-01 08:47:50] [INFO ] Deduced a trap composed of 113 places in 450 ms of which 4 ms to minimize.
[2024-06-01 08:47:50] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 4 ms to minimize.
[2024-06-01 08:47:51] [INFO ] Deduced a trap composed of 146 places in 579 ms of which 5 ms to minimize.
[2024-06-01 08:47:51] [INFO ] Deduced a trap composed of 102 places in 504 ms of which 4 ms to minimize.
[2024-06-01 08:47:52] [INFO ] Deduced a trap composed of 143 places in 445 ms of which 5 ms to minimize.
[2024-06-01 08:47:52] [INFO ] Deduced a trap composed of 103 places in 458 ms of which 5 ms to minimize.
[2024-06-01 08:47:53] [INFO ] Deduced a trap composed of 99 places in 471 ms of which 5 ms to minimize.
[2024-06-01 08:47:53] [INFO ] Deduced a trap composed of 93 places in 461 ms of which 4 ms to minimize.
[2024-06-01 08:47:54] [INFO ] Deduced a trap composed of 127 places in 460 ms of which 4 ms to minimize.
[2024-06-01 08:47:54] [INFO ] Deduced a trap composed of 101 places in 444 ms of which 4 ms to minimize.
[2024-06-01 08:47:55] [INFO ] Deduced a trap composed of 116 places in 457 ms of which 4 ms to minimize.
[2024-06-01 08:47:55] [INFO ] Deduced a trap composed of 94 places in 388 ms of which 4 ms to minimize.
[2024-06-01 08:47:56] [INFO ] Deduced a trap composed of 141 places in 490 ms of which 5 ms to minimize.
[2024-06-01 08:47:56] [INFO ] Deduced a trap composed of 30 places in 501 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:47:57] [INFO ] Deduced a trap composed of 99 places in 486 ms of which 4 ms to minimize.
[2024-06-01 08:47:57] [INFO ] Deduced a trap composed of 94 places in 543 ms of which 11 ms to minimize.
[2024-06-01 08:47:58] [INFO ] Deduced a trap composed of 86 places in 497 ms of which 5 ms to minimize.
[2024-06-01 08:47:58] [INFO ] Deduced a trap composed of 74 places in 479 ms of which 4 ms to minimize.
[2024-06-01 08:47:59] [INFO ] Deduced a trap composed of 60 places in 486 ms of which 5 ms to minimize.
[2024-06-01 08:47:59] [INFO ] Deduced a trap composed of 128 places in 482 ms of which 4 ms to minimize.
[2024-06-01 08:48:00] [INFO ] Deduced a trap composed of 112 places in 482 ms of which 4 ms to minimize.
[2024-06-01 08:48:00] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:48:00] [INFO ] Deduced a trap composed of 95 places in 477 ms of which 4 ms to minimize.
[2024-06-01 08:48:01] [INFO ] Deduced a trap composed of 89 places in 432 ms of which 4 ms to minimize.
[2024-06-01 08:48:01] [INFO ] Deduced a trap composed of 92 places in 425 ms of which 5 ms to minimize.
[2024-06-01 08:48:02] [INFO ] Deduced a trap composed of 54 places in 477 ms of which 4 ms to minimize.
[2024-06-01 08:48:02] [INFO ] Deduced a trap composed of 81 places in 417 ms of which 4 ms to minimize.
[2024-06-01 08:48:03] [INFO ] Deduced a trap composed of 68 places in 494 ms of which 5 ms to minimize.
[2024-06-01 08:48:03] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 4 ms to minimize.
[2024-06-01 08:48:04] [INFO ] Deduced a trap composed of 84 places in 492 ms of which 5 ms to minimize.
[2024-06-01 08:48:05] [INFO ] Deduced a trap composed of 99 places in 522 ms of which 4 ms to minimize.
[2024-06-01 08:48:05] [INFO ] Deduced a trap composed of 70 places in 509 ms of which 4 ms to minimize.
[2024-06-01 08:48:06] [INFO ] Deduced a trap composed of 55 places in 466 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 19/89 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:07] [INFO ] Deduced a trap composed of 110 places in 448 ms of which 5 ms to minimize.
[2024-06-01 08:48:07] [INFO ] Deduced a trap composed of 123 places in 555 ms of which 4 ms to minimize.
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 110 places in 474 ms of which 4 ms to minimize.
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 120 places in 456 ms of which 4 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 115 places in 465 ms of which 4 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 90 places in 420 ms of which 5 ms to minimize.
[2024-06-01 08:48:10] [INFO ] Deduced a trap composed of 85 places in 461 ms of which 5 ms to minimize.
[2024-06-01 08:48:10] [INFO ] Deduced a trap composed of 93 places in 473 ms of which 4 ms to minimize.
[2024-06-01 08:48:11] [INFO ] Deduced a trap composed of 86 places in 483 ms of which 4 ms to minimize.
[2024-06-01 08:48:11] [INFO ] Deduced a trap composed of 122 places in 468 ms of which 4 ms to minimize.
[2024-06-01 08:48:12] [INFO ] Deduced a trap composed of 122 places in 469 ms of which 5 ms to minimize.
[2024-06-01 08:48:12] [INFO ] Deduced a trap composed of 159 places in 520 ms of which 5 ms to minimize.
[2024-06-01 08:48:13] [INFO ] Deduced a trap composed of 114 places in 532 ms of which 6 ms to minimize.
[2024-06-01 08:48:13] [INFO ] Deduced a trap composed of 95 places in 530 ms of which 4 ms to minimize.
[2024-06-01 08:48:14] [INFO ] Deduced a trap composed of 111 places in 480 ms of which 5 ms to minimize.
[2024-06-01 08:48:14] [INFO ] Deduced a trap composed of 102 places in 492 ms of which 4 ms to minimize.
[2024-06-01 08:48:15] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:16] [INFO ] Deduced a trap composed of 103 places in 486 ms of which 4 ms to minimize.
[2024-06-01 08:48:17] [INFO ] Deduced a trap composed of 111 places in 457 ms of which 4 ms to minimize.
[2024-06-01 08:48:17] [INFO ] Deduced a trap composed of 145 places in 428 ms of which 5 ms to minimize.
[2024-06-01 08:48:18] [INFO ] Deduced a trap composed of 120 places in 417 ms of which 4 ms to minimize.
[2024-06-01 08:48:18] [INFO ] Deduced a trap composed of 114 places in 464 ms of which 5 ms to minimize.
[2024-06-01 08:48:18] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:48:19] [INFO ] Deduced a trap composed of 95 places in 478 ms of which 4 ms to minimize.
[2024-06-01 08:48:20] [INFO ] Deduced a trap composed of 82 places in 572 ms of which 5 ms to minimize.
[2024-06-01 08:48:21] [INFO ] Deduced a trap composed of 97 places in 522 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:21] [INFO ] Deduced a trap composed of 112 places in 461 ms of which 4 ms to minimize.
[2024-06-01 08:48:22] [INFO ] Deduced a trap composed of 149 places in 442 ms of which 4 ms to minimize.
[2024-06-01 08:48:23] [INFO ] Deduced a trap composed of 83 places in 476 ms of which 5 ms to minimize.
[2024-06-01 08:48:23] [INFO ] Deduced a trap composed of 105 places in 460 ms of which 5 ms to minimize.
[2024-06-01 08:48:24] [INFO ] Deduced a trap composed of 95 places in 469 ms of which 5 ms to minimize.
[2024-06-01 08:48:24] [INFO ] Deduced a trap composed of 119 places in 478 ms of which 4 ms to minimize.
[2024-06-01 08:48:25] [INFO ] Deduced a trap composed of 109 places in 466 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:26] [INFO ] Deduced a trap composed of 114 places in 448 ms of which 5 ms to minimize.
[2024-06-01 08:48:26] [INFO ] Deduced a trap composed of 84 places in 459 ms of which 5 ms to minimize.
[2024-06-01 08:48:27] [INFO ] Deduced a trap composed of 131 places in 434 ms of which 5 ms to minimize.
[2024-06-01 08:48:27] [INFO ] Deduced a trap composed of 128 places in 432 ms of which 4 ms to minimize.
[2024-06-01 08:48:28] [INFO ] Deduced a trap composed of 91 places in 425 ms of which 4 ms to minimize.
[2024-06-01 08:48:28] [INFO ] Deduced a trap composed of 129 places in 465 ms of which 5 ms to minimize.
[2024-06-01 08:48:29] [INFO ] Deduced a trap composed of 93 places in 466 ms of which 5 ms to minimize.
[2024-06-01 08:48:30] [INFO ] Deduced a trap composed of 67 places in 482 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:31] [INFO ] Deduced a trap composed of 138 places in 426 ms of which 4 ms to minimize.
[2024-06-01 08:48:32] [INFO ] Deduced a trap composed of 177 places in 412 ms of which 4 ms to minimize.
[2024-06-01 08:48:32] [INFO ] Deduced a trap composed of 139 places in 421 ms of which 4 ms to minimize.
[2024-06-01 08:48:33] [INFO ] Deduced a trap composed of 137 places in 529 ms of which 5 ms to minimize.
[2024-06-01 08:48:33] [INFO ] Deduced a trap composed of 99 places in 492 ms of which 4 ms to minimize.
[2024-06-01 08:48:34] [INFO ] Deduced a trap composed of 121 places in 540 ms of which 4 ms to minimize.
[2024-06-01 08:48:34] [INFO ] Deduced a trap composed of 107 places in 452 ms of which 4 ms to minimize.
[2024-06-01 08:48:35] [INFO ] Deduced a trap composed of 109 places in 491 ms of which 4 ms to minimize.
[2024-06-01 08:48:35] [INFO ] Deduced a trap composed of 92 places in 530 ms of which 5 ms to minimize.
[2024-06-01 08:48:36] [INFO ] Deduced a trap composed of 104 places in 445 ms of which 5 ms to minimize.
[2024-06-01 08:48:37] [INFO ] Deduced a trap composed of 146 places in 429 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 11/141 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:38] [INFO ] Deduced a trap composed of 117 places in 474 ms of which 4 ms to minimize.
[2024-06-01 08:48:39] [INFO ] Deduced a trap composed of 109 places in 536 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:40] [INFO ] Deduced a trap composed of 109 places in 542 ms of which 5 ms to minimize.
[2024-06-01 08:48:41] [INFO ] Deduced a trap composed of 147 places in 535 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 158 places in 518 ms of which 5 ms to minimize.
[2024-06-01 08:48:43] [INFO ] Deduced a trap composed of 127 places in 516 ms of which 5 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 136 places in 487 ms of which 4 ms to minimize.
[2024-06-01 08:48:44] [INFO ] Deduced a trap composed of 135 places in 492 ms of which 4 ms to minimize.
[2024-06-01 08:48:45] [INFO ] Deduced a trap composed of 121 places in 491 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/495 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:46] [INFO ] Deduced a trap composed of 57 places in 422 ms of which 4 ms to minimize.
[2024-06-01 08:48:47] [INFO ] Deduced a trap composed of 58 places in 437 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:48] [INFO ] Deduced a trap composed of 83 places in 354 ms of which 4 ms to minimize.
[2024-06-01 08:48:49] [INFO ] Deduced a trap composed of 183 places in 454 ms of which 4 ms to minimize.
[2024-06-01 08:48:49] [INFO ] Deduced a trap composed of 112 places in 455 ms of which 4 ms to minimize.
[2024-06-01 08:48:50] [INFO ] Deduced a trap composed of 109 places in 400 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/495 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/495 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 19 (OVERLAPS) 4/499 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/499 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:48:53] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 5 ms to minimize.
[2024-06-01 08:48:53] [INFO ] Deduced a trap composed of 23 places in 504 ms of which 5 ms to minimize.
SMT process timed out in 89387ms, After SMT, problems are : Problem set: 0 solved, 45 unsolved
Fused 45 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 72 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 2960/2960 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 498 transition count 2951
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 498 transition count 2951
Applied a total of 2 rules in 233 ms. Remains 498 /499 variables (removed 1) and now considering 2951/2960 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 498/499 places, 2951/2960 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-01 08:48:54] [INFO ] Flatten gal took : 118 ms
[2024-06-01 08:48:54] [INFO ] Flatten gal took : 154 ms
[2024-06-01 08:48:54] [INFO ] Input system was already deterministic with 3321 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 820 transition count 3249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 820 transition count 3249
Applied a total of 16 rules in 116 ms. Remains 820 /828 variables (removed 8) and now considering 3249/3321 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 820/828 places, 3249/3321 transitions.
[2024-06-01 08:48:54] [INFO ] Flatten gal took : 93 ms
[2024-06-01 08:48:55] [INFO ] Flatten gal took : 106 ms
[2024-06-01 08:48:55] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 3312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 3312
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 819 transition count 3060
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 567 transition count 3060
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 531 place count 558 transition count 2979
Iterating global reduction 2 with 9 rules applied. Total rules applied 540 place count 558 transition count 2979
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 682 place count 487 transition count 2908
Applied a total of 682 rules in 364 ms. Remains 487 /828 variables (removed 341) and now considering 2908/3321 (removed 413) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 379 ms. Remains : 487/828 places, 2908/3321 transitions.
[2024-06-01 08:48:55] [INFO ] Flatten gal took : 81 ms
[2024-06-01 08:48:55] [INFO ] Flatten gal took : 94 ms
[2024-06-01 08:48:56] [INFO ] Input system was already deterministic with 2908 transitions.
RANDOM walk for 39035 steps (8 resets) in 248 ms. (156 steps per ms) remains 0/1 properties
FORMULA EisenbergMcGuire-PT-09-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 822 transition count 3267
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 822 transition count 3267
Applied a total of 12 rules in 83 ms. Remains 822 /828 variables (removed 6) and now considering 3267/3321 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 822/828 places, 3267/3321 transitions.
[2024-06-01 08:48:56] [INFO ] Flatten gal took : 98 ms
[2024-06-01 08:48:56] [INFO ] Flatten gal took : 109 ms
[2024-06-01 08:48:56] [INFO ] Input system was already deterministic with 3267 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 3312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 3312
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 819 transition count 3061
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 568 transition count 3061
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 529 place count 559 transition count 2980
Iterating global reduction 2 with 9 rules applied. Total rules applied 538 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 682 place count 487 transition count 2908
Applied a total of 682 rules in 279 ms. Remains 487 /828 variables (removed 341) and now considering 2908/3321 (removed 413) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 292 ms. Remains : 487/828 places, 2908/3321 transitions.
[2024-06-01 08:48:57] [INFO ] Flatten gal took : 80 ms
[2024-06-01 08:48:57] [INFO ] Flatten gal took : 99 ms
[2024-06-01 08:48:57] [INFO ] Input system was already deterministic with 2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 344 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324440 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324440 steps, saw 200101 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-06-01 08:49:00] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-06-01 08:49:00] [INFO ] Computed 28 invariants in 9 ms
[2024-06-01 08:49:00] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:00] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 121/413 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 168/581 variables, 77/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 32/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 280/861 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/861 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/875 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/875 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 441/1316 variables, 294/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1316 variables, 292/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1316 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1316 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 185/292 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 121/413 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/581 variables, 77/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 32/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/581 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 280/861 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/861 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 14/875 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/875 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 441/1316 variables, 294/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1316 variables, 292/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:02] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1316 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1316 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1316 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 875 constraints, problems are : Problem set: 0 solved, 1 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 116 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 487/487 places, 2908/2908 transitions.
RANDOM walk for 400000 steps (8 resets) in 6592 ms. (60 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 08:49:04] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:49:04] [INFO ] Invariant cache hit.
[2024-06-01 08:49:04] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-06-01 08:49:04] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 22 ms returned sat
[2024-06-01 08:49:04] [INFO ] After 376ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 08:49:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:49:04] [INFO ] After 103ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:49:04] [INFO ] After 165ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:49:04] [INFO ] After 715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:49:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-06-01 08:49:05] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-06-01 08:49:05] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:49:05] [INFO ] After 67ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:49:05] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:49:05] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 17433 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3072 ms. (1301 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1620070 steps, run timeout after 15001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 1620070 steps, saw 847755 distinct states, run finished after 15001 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 08:49:26] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:49:26] [INFO ] Invariant cache hit.
[2024-06-01 08:49:26] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:26] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 121/413 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 168/581 variables, 77/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 32/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 280/861 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/861 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/875 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/875 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 441/1316 variables, 294/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1316 variables, 292/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1316 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1316 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/413 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/581 variables, 77/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/861 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/861 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/875 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:27] [INFO ] Deduced a trap composed of 92 places in 499 ms of which 5 ms to minimize.
[2024-06-01 08:49:28] [INFO ] Deduced a trap composed of 92 places in 548 ms of which 5 ms to minimize.
[2024-06-01 08:49:28] [INFO ] Deduced a trap composed of 88 places in 482 ms of which 5 ms to minimize.
[2024-06-01 08:49:29] [INFO ] Deduced a trap composed of 84 places in 510 ms of which 5 ms to minimize.
[2024-06-01 08:49:29] [INFO ] Deduced a trap composed of 73 places in 557 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/875 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 441/1316 variables, 294/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1316 variables, 292/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:30] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:49:30] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:49:30] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1316 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1316 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1316 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3837 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 4557ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 118 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 116 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-06-01 08:49:31] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:49:31] [INFO ] Invariant cache hit.
[2024-06-01 08:49:32] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-06-01 08:49:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:49:32] [INFO ] Invariant cache hit.
[2024-06-01 08:49:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:49:35] [INFO ] Implicit Places using invariants and state equation in 3563 ms returned []
Implicit Place search using SMT with State Equation took 4458 ms to find 0 implicit places.
[2024-06-01 08:49:35] [INFO ] Redundant transitions in 207 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-06-01 08:49:35] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:49:35] [INFO ] Invariant cache hit.
[2024-06-01 08:49:35] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32167ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37012 ms. Remains : 487/487 places, 2908/2908 transitions.
RANDOM walk for 400000 steps (8 resets) in 1634 ms. (244 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 08:50:08] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-06-01 08:50:08] [INFO ] Invariant cache hit.
[2024-06-01 08:50:08] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-06-01 08:50:08] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-06-01 08:50:08] [INFO ] After 300ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 08:50:08] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-06-01 08:50:09] [INFO ] After 101ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:50:09] [INFO ] After 174ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:50:09] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:50:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-06-01 08:50:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-06-01 08:50:09] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:50:09] [INFO ] After 69ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:50:09] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:50:09] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 1128 steps (0 resets) in 11 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 798 steps, run visited all 1 properties in 12 ms. (steps per millisecond=66 )
Probabilistic random walk after 798 steps, saw 708 distinct states, run finished after 18 ms. (steps per millisecond=44 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 6 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 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 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 68 times.
Iterating global reduction 4 with 68 rules applied. Total rules applied 702 place count 138 transition count 197
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 4 with 68 rules applied. Total rules applied 770 place count 70 transition count 197
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 778 place count 70 transition count 197
Applied a total of 778 rules in 72 ms. Remains 70 /487 variables (removed 417) and now considering 197/2908 (removed 2711) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 70 cols
[2024-06-01 08:50:09] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 08:50:09] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 08:50:10] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:50:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-06-01 08:50:10] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:50:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:50:10] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:50:10] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:50:10] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 317 ms.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 819 transition count 3240
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 819 transition count 3240
Applied a total of 18 rules in 89 ms. Remains 819 /828 variables (removed 9) and now considering 3240/3321 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 819/828 places, 3240/3321 transitions.
[2024-06-01 08:50:10] [INFO ] Flatten gal took : 82 ms
[2024-06-01 08:50:10] [INFO ] Flatten gal took : 95 ms
[2024-06-01 08:50:10] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 3312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 3312
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 819 transition count 3061
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 568 transition count 3061
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 529 place count 559 transition count 2980
Iterating global reduction 2 with 9 rules applied. Total rules applied 538 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 682 place count 487 transition count 2908
Applied a total of 682 rules in 326 ms. Remains 487 /828 variables (removed 341) and now considering 2908/3321 (removed 413) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 327 ms. Remains : 487/828 places, 2908/3321 transitions.
[2024-06-01 08:50:11] [INFO ] Flatten gal took : 70 ms
[2024-06-01 08:50:11] [INFO ] Flatten gal took : 83 ms
[2024-06-01 08:50:11] [INFO ] Input system was already deterministic with 2908 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 819 transition count 3240
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 819 transition count 3240
Applied a total of 18 rules in 65 ms. Remains 819 /828 variables (removed 9) and now considering 3240/3321 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 819/828 places, 3240/3321 transitions.
[2024-06-01 08:50:11] [INFO ] Flatten gal took : 79 ms
[2024-06-01 08:50:11] [INFO ] Flatten gal took : 90 ms
[2024-06-01 08:50:11] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 3312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 3312
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 819 transition count 3061
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 568 transition count 3061
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 529 place count 559 transition count 2980
Iterating global reduction 2 with 9 rules applied. Total rules applied 538 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 682 place count 487 transition count 2908
Applied a total of 682 rules in 241 ms. Remains 487 /828 variables (removed 341) and now considering 2908/3321 (removed 413) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 241 ms. Remains : 487/828 places, 2908/3321 transitions.
[2024-06-01 08:50:11] [INFO ] Flatten gal took : 69 ms
[2024-06-01 08:50:12] [INFO ] Flatten gal took : 83 ms
[2024-06-01 08:50:12] [INFO ] Input system was already deterministic with 2908 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 820 transition count 3249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 820 transition count 3249
Applied a total of 16 rules in 45 ms. Remains 820 /828 variables (removed 8) and now considering 3249/3321 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 820/828 places, 3249/3321 transitions.
[2024-06-01 08:50:12] [INFO ] Flatten gal took : 77 ms
[2024-06-01 08:50:12] [INFO ] Flatten gal took : 91 ms
[2024-06-01 08:50:12] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 820 transition count 3249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 820 transition count 3249
Applied a total of 16 rules in 44 ms. Remains 820 /828 variables (removed 8) and now considering 3249/3321 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 820/828 places, 3249/3321 transitions.
[2024-06-01 08:50:12] [INFO ] Flatten gal took : 75 ms
[2024-06-01 08:50:12] [INFO ] Flatten gal took : 87 ms
[2024-06-01 08:50:12] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 819 transition count 3240
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 819 transition count 3240
Applied a total of 18 rules in 51 ms. Remains 819 /828 variables (removed 9) and now considering 3240/3321 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 819/828 places, 3240/3321 transitions.
[2024-06-01 08:50:13] [INFO ] Flatten gal took : 72 ms
[2024-06-01 08:50:13] [INFO ] Flatten gal took : 87 ms
[2024-06-01 08:50:13] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 3312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 3312
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 247 Pre rules applied. Total rules applied 18 place count 819 transition count 3065
Deduced a syphon composed of 247 places in 3 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 2 with 494 rules applied. Total rules applied 512 place count 572 transition count 3065
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 520 place count 564 transition count 2993
Iterating global reduction 2 with 8 rules applied. Total rules applied 528 place count 564 transition count 2993
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 492 transition count 2921
Applied a total of 672 rules in 219 ms. Remains 492 /828 variables (removed 336) and now considering 2921/3321 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 221 ms. Remains : 492/828 places, 2921/3321 transitions.
[2024-06-01 08:50:13] [INFO ] Flatten gal took : 67 ms
[2024-06-01 08:50:13] [INFO ] Flatten gal took : 80 ms
[2024-06-01 08:50:13] [INFO ] Input system was already deterministic with 2921 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 820 transition count 3249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 820 transition count 3249
Applied a total of 16 rules in 49 ms. Remains 820 /828 variables (removed 8) and now considering 3249/3321 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 820/828 places, 3249/3321 transitions.
[2024-06-01 08:50:13] [INFO ] Flatten gal took : 71 ms
[2024-06-01 08:50:14] [INFO ] Flatten gal took : 84 ms
[2024-06-01 08:50:14] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 3312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 3312
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 819 transition count 3060
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 567 transition count 3060
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 531 place count 558 transition count 2979
Iterating global reduction 2 with 9 rules applied. Total rules applied 540 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 684 place count 486 transition count 2907
Applied a total of 684 rules in 209 ms. Remains 486 /828 variables (removed 342) and now considering 2907/3321 (removed 414) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 209 ms. Remains : 486/828 places, 2907/3321 transitions.
[2024-06-01 08:50:14] [INFO ] Flatten gal took : 66 ms
[2024-06-01 08:50:14] [INFO ] Flatten gal took : 78 ms
[2024-06-01 08:50:14] [INFO ] Input system was already deterministic with 2907 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 819 transition count 3240
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 819 transition count 3240
Applied a total of 18 rules in 49 ms. Remains 819 /828 variables (removed 9) and now considering 3240/3321 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 819/828 places, 3240/3321 transitions.
[2024-06-01 08:50:14] [INFO ] Flatten gal took : 83 ms
[2024-06-01 08:50:14] [INFO ] Flatten gal took : 80 ms
[2024-06-01 08:50:15] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 3321/3321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 820 transition count 3249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 820 transition count 3249
Applied a total of 16 rules in 49 ms. Remains 820 /828 variables (removed 8) and now considering 3249/3321 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 820/828 places, 3249/3321 transitions.
[2024-06-01 08:50:15] [INFO ] Flatten gal took : 71 ms
[2024-06-01 08:50:15] [INFO ] Flatten gal took : 84 ms
[2024-06-01 08:50:15] [INFO ] Input system was already deterministic with 3249 transitions.
[2024-06-01 08:50:15] [INFO ] Flatten gal took : 84 ms
[2024-06-01 08:50:15] [INFO ] Flatten gal took : 86 ms
[2024-06-01 08:50:15] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 08:50:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 828 places, 3321 transitions and 16524 arcs took 27 ms.
Total runtime 297674 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2023-14
Could not compute solution for formula : EisenbergMcGuire-PT-09-CTLFireability-2023-15
BK_STOP 1717231816061
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 EisenbergMcGuire-PT-09-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1429/ctl_0_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1429/ctl_1_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1429/ctl_2_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1429/ctl_3_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1429/ctl_4_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1429/ctl_5_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1429/ctl_6_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1429/ctl_7_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1429/ctl_8_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1429/ctl_9_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1429/ctl_10_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1429/ctl_11_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1429/ctl_12_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1429/ctl_13_
ctl formula name EisenbergMcGuire-PT-09-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1429/ctl_14_
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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r492-smll-171636266400194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;