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-171636266300178.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-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 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:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 1.2M 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-07-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225777193

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:09:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:09:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:09:40] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2024-06-01 07:09:40] [INFO ] Transformed 553 places.
[2024-06-01 07:09:40] [INFO ] Transformed 1960 transitions.
[2024-06-01 07:09:40] [INFO ] Found NUPN structural information;
[2024-06-01 07:09:40] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 1029 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 113 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 524 transition count 1757
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 524 transition count 1757
Applied a total of 58 rules in 165 ms. Remains 524 /553 variables (removed 29) and now considering 1757/1960 (removed 203) transitions.
[2024-06-01 07:09:41] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
// Phase 1: matrix 798 rows 524 cols
[2024-06-01 07:09:41] [INFO ] Computed 22 invariants in 80 ms
[2024-06-01 07:09:42] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-06-01 07:09:42] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 07:09:42] [INFO ] Invariant cache hit.
[2024-06-01 07:09:43] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-06-01 07:09:45] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3792 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2024-06-01 07:09:45] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 07:09:45] [INFO ] Invariant cache hit.
[2024-06-01 07:09:45] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 63 places in 475 ms of which 61 ms to minimize.
SMT process timed out in 32488ms, After SMT, problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 32587ms
Starting structural reductions in LTL mode, iteration 1 : 524/553 places, 1757/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36625 ms. Remains : 524/553 places, 1757/1960 transitions.
Support contains 113 out of 524 places after structural reductions.
[2024-06-01 07:10:18] [INFO ] Flatten gal took : 293 ms
[2024-06-01 07:10:18] [INFO ] Flatten gal took : 174 ms
[2024-06-01 07:10:18] [INFO ] Input system was already deterministic with 1757 transitions.
Support contains 111 out of 524 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3427 ms. (11 steps per ms) remains 62/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 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 39 ms. (100 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 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 35 ms. (111 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 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 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 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 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 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 21 ms. (182 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 15 ms. (250 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 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 37 ms. (105 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 25 ms. (154 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 15 ms. (250 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 18 ms. (210 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 25 ms. (154 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 14 ms. (266 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 16 ms. (235 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 18 ms. (210 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 18 ms. (210 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 21 ms. (182 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 14 ms. (266 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 14 ms. (266 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 14 ms. (266 steps per ms) remains 62/62 properties
[2024-06-01 07:10:20] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-06-01 07:10:20] [INFO ] Invariant cache hit.
[2024-06-01 07:10:20] [INFO ] State equation strengthened by 298 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp66 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 59 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 425/523 variables, 14/15 constraints. Problems are: Problem set: 4 solved, 58 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 6/21 constraints. Problems are: Problem set: 5 solved, 57 unsolved
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 175 places in 503 ms of which 6 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 32 places in 511 ms of which 9 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 93 places in 489 ms of which 7 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 96 places in 651 ms of which 7 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 68 places in 459 ms of which 8 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 76 places in 523 ms of which 7 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/1322 variables, and 29 constraints, problems are : Problem set: 5 solved, 57 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/524 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 5 solved, 57 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 436/522 variables, 14/15 constraints. Problems are: Problem set: 7 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 5/20 constraints. Problems are: Problem set: 7 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 8/28 constraints. Problems are: Problem set: 7 solved, 55 unsolved
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 141 places in 395 ms of which 6 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 150 places in 495 ms of which 8 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 120 places in 704 ms of which 6 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 110 places in 564 ms of which 6 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 10240ms, After SMT, problems are : Problem set: 7 solved, 55 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 524 transition count 1756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 523 transition count 1756
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 139 Pre rules applied. Total rules applied 2 place count 523 transition count 1617
Deduced a syphon composed of 139 places in 4 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 280 place count 384 transition count 1617
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 284 place count 380 transition count 1589
Iterating global reduction 2 with 4 rules applied. Total rules applied 288 place count 380 transition count 1589
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 8 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 372 place count 338 transition count 1547
Applied a total of 372 rules in 387 ms. Remains 338 /524 variables (removed 186) and now considering 1547/1757 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 338/524 places, 1547/1757 transitions.
RANDOM walk for 40000 steps (8 resets) in 1148 ms. (34 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 53/53 properties
Interrupted probabilistic random walk after 92864 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :15 out of 53
Probabilistic random walk after 92864 steps, saw 59448 distinct states, run finished after 3020 ms. (steps per millisecond=30 ) properties seen :15
[2024-06-01 07:10:34] [INFO ] Flow matrix only has 588 transitions (discarded 959 similar events)
// Phase 1: matrix 588 rows 338 cols
[2024-06-01 07:10:34] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 07:10:34] [INFO ] State equation strengthened by 274 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 270/333 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 123 places in 393 ms of which 6 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 5 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 61 places in 463 ms of which 6 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 15 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 65 places in 454 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 87 places in 455 ms of which 6 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 81 places in 464 ms of which 5 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 68 places in 468 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 5/338 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 100 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 8 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 21 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 26 places in 482 ms of which 5 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 5 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 95 places in 416 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 94 places in 572 ms of which 6 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 16 places in 580 ms of which 6 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 95 places in 507 ms of which 5 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 86 places in 501 ms of which 5 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 82 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 56 places in 460 ms of which 6 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 84 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 86 places in 417 ms of which 5 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 81 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 95 places in 442 ms of which 5 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 84 places in 450 ms of which 7 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 65 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 82 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 92 places in 433 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 3 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 98 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 76 places in 453 ms of which 7 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 96 places in 402 ms of which 5 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 3 places in 440 ms of which 5 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 86 places in 451 ms of which 5 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 97 places in 440 ms of which 6 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 73 places in 404 ms of which 5 ms to minimize.
Problem AtomicPropp35 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 5/67 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 79 places in 461 ms of which 5 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 59 places in 399 ms of which 5 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 65 places in 366 ms of which 4 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 88 places in 439 ms of which 5 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 83 places in 407 ms of which 4 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 91 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 5 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 79 places in 393 ms of which 4 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 30 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 30 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 11/78 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 78 places in 501 ms of which 6 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 82 places in 462 ms of which 5 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 76 places in 398 ms of which 5 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 5 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 73 places in 367 ms of which 4 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 73 places in 477 ms of which 5 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 48 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 86 places in 353 ms of which 4 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 71 places in 453 ms of which 5 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 4 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 15/93 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 82 places in 373 ms of which 5 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 82 places in 485 ms of which 6 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 5 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 65 places in 472 ms of which 5 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 57 places in 462 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 7/100 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 80 places in 379 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 63 places in 456 ms of which 5 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 6 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 65 places in 475 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/338 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 99 places in 446 ms of which 6 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 56 places in 472 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/338 variables, 2/106 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 20 (OVERLAPS) 588/926 variables, 338/444 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/926 variables, 274/718 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 926/926 variables, and 718 constraints, problems are : Problem set: 1 solved, 37 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 338/338 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 1 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 273/333 variables, 14/15 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 15/33 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 118 places in 493 ms of which 5 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 105 places in 456 ms of which 4 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 132 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 104 places in 432 ms of which 4 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 104 places in 426 ms of which 5 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 70 places in 458 ms of which 5 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 105 places in 463 ms of which 6 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 91 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 87 places in 489 ms of which 5 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 69 places in 444 ms of which 5 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 92 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 109 places in 441 ms of which 5 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 110 places in 417 ms of which 5 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 82 places in 429 ms of which 6 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 80 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:11:28] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 16/49 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 88 places in 404 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 5/338 variables, 4/54 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 69/123 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 88 places in 384 ms of which 4 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 26 places in 345 ms of which 4 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 65 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 3 places in 441 ms of which 5 ms to minimize.
Problem AtomicPropp62 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 4/127 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:11:33] [INFO ] Deduced a trap composed of 56 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 70 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 59 places in 456 ms of which 5 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 73 places in 434 ms of which 5 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 66 places in 440 ms of which 5 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 62 places in 425 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 7/134 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 83 places in 361 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 2/136 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 88 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 78 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 67 places in 412 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 3/139 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 15 (OVERLAPS) 588/926 variables, 338/477 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/926 variables, 274/751 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/926 variables, 36/787 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 64 places in 468 ms of which 5 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 49 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 63 places in 445 ms of which 6 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 5 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 6 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/926 variables, 7/794 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 59 places in 396 ms of which 5 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 60 places in 365 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/926 variables, 2/796 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 72 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 4 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 5 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 74 places in 492 ms of which 6 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 75 places in 454 ms of which 5 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 42 places in 413 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/926 variables, 7/803 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 72 places in 449 ms of which 5 ms to minimize.
SMT process timed out in 90487ms, After SMT, problems are : Problem set: 2 solved, 36 unsolved
Fused 36 Parikh solutions to 17 different solutions.
Parikh walk visited 3 properties in 3747 ms.
Support contains 55 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 1547/1547 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 338 transition count 1537
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 328 transition count 1537
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 323 transition count 1502
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 323 transition count 1502
Applied a total of 30 rules in 88 ms. Remains 323 /338 variables (removed 15) and now considering 1502/1547 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 323/338 places, 1502/1547 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:12:09] [INFO ] Flatten gal took : 76 ms
[2024-06-01 07:12:09] [INFO ] Flatten gal took : 94 ms
[2024-06-01 07:12:09] [INFO ] Input system was already deterministic with 1757 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 511 transition count 1666
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 511 transition count 1666
Applied a total of 26 rules in 42 ms. Remains 511 /524 variables (removed 13) and now considering 1666/1757 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 511/524 places, 1666/1757 transitions.
[2024-06-01 07:12:09] [INFO ] Flatten gal took : 68 ms
[2024-06-01 07:12:09] [INFO ] Flatten gal took : 79 ms
[2024-06-01 07:12:10] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 512 transition count 1673
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 512 transition count 1673
Applied a total of 24 rules in 36 ms. Remains 512 /524 variables (removed 12) and now considering 1673/1757 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 512/524 places, 1673/1757 transitions.
[2024-06-01 07:12:10] [INFO ] Flatten gal took : 65 ms
[2024-06-01 07:12:10] [INFO ] Flatten gal took : 74 ms
[2024-06-01 07:12:10] [INFO ] Input system was already deterministic with 1673 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 524 transition count 1750
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 517 transition count 1750
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 517 transition count 1598
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 365 transition count 1598
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 352 transition count 1507
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 352 transition count 1507
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 426 place count 311 transition count 1466
Applied a total of 426 rules in 134 ms. Remains 311 /524 variables (removed 213) and now considering 1466/1757 (removed 291) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 135 ms. Remains : 311/524 places, 1466/1757 transitions.
[2024-06-01 07:12:10] [INFO ] Flatten gal took : 50 ms
[2024-06-01 07:12:10] [INFO ] Flatten gal took : 59 ms
[2024-06-01 07:12:10] [INFO ] Input system was already deterministic with 1466 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 524 transition count 1751
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 518 transition count 1751
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 12 place count 518 transition count 1598
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 318 place count 365 transition count 1598
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 352 transition count 1507
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 352 transition count 1507
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 428 place count 310 transition count 1465
Applied a total of 428 rules in 122 ms. Remains 310 /524 variables (removed 214) and now considering 1465/1757 (removed 292) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 310/524 places, 1465/1757 transitions.
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 48 ms
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 54 ms
[2024-06-01 07:12:11] [INFO ] Input system was already deterministic with 1465 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 511 transition count 1666
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 511 transition count 1666
Applied a total of 26 rules in 35 ms. Remains 511 /524 variables (removed 13) and now considering 1666/1757 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 511/524 places, 1666/1757 transitions.
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 54 ms
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 58 ms
[2024-06-01 07:12:11] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 512 transition count 1673
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 512 transition count 1673
Applied a total of 24 rules in 21 ms. Remains 512 /524 variables (removed 12) and now considering 1673/1757 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 512/524 places, 1673/1757 transitions.
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 47 ms
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 54 ms
[2024-06-01 07:12:11] [INFO ] Input system was already deterministic with 1673 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 511 transition count 1666
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 511 transition count 1666
Applied a total of 26 rules in 20 ms. Remains 511 /524 variables (removed 13) and now considering 1666/1757 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 511/524 places, 1666/1757 transitions.
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:12:11] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:12:12] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 511 transition count 1666
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 511 transition count 1666
Applied a total of 26 rules in 21 ms. Remains 511 /524 variables (removed 13) and now considering 1666/1757 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 511/524 places, 1666/1757 transitions.
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:12:12] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 513 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 513 transition count 1680
Applied a total of 22 rules in 21 ms. Remains 513 /524 variables (removed 11) and now considering 1680/1757 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 513/524 places, 1680/1757 transitions.
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 54 ms
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 47 ms
[2024-06-01 07:12:12] [INFO ] Input system was already deterministic with 1680 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 524 transition count 1750
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 517 transition count 1750
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 517 transition count 1597
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 364 transition count 1597
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 332 place count 352 transition count 1513
Iterating global reduction 2 with 12 rules applied. Total rules applied 344 place count 352 transition count 1513
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 428 place count 310 transition count 1471
Applied a total of 428 rules in 99 ms. Remains 310 /524 variables (removed 214) and now considering 1471/1757 (removed 286) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 310/524 places, 1471/1757 transitions.
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:12:12] [INFO ] Input system was already deterministic with 1471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 511 transition count 1666
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 511 transition count 1666
Applied a total of 26 rules in 20 ms. Remains 511 /524 variables (removed 13) and now considering 1666/1757 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 511/524 places, 1666/1757 transitions.
[2024-06-01 07:12:12] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:12:13] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:12:13] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 524 transition count 1750
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 517 transition count 1750
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 517 transition count 1598
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 365 transition count 1598
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 330 place count 353 transition count 1514
Iterating global reduction 2 with 12 rules applied. Total rules applied 342 place count 353 transition count 1514
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 426 place count 311 transition count 1472
Applied a total of 426 rules in 90 ms. Remains 311 /524 variables (removed 213) and now considering 1472/1757 (removed 285) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 311/524 places, 1472/1757 transitions.
[2024-06-01 07:12:13] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:12:13] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:12:13] [INFO ] Input system was already deterministic with 1472 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 532832 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 532832 steps, saw 217442 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-01 07:12:16] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
// Phase 1: matrix 513 rows 311 cols
[2024-06-01 07:12:16] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:12:16] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 273/412 variables, 139/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 57/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/492 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 21/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 128/620 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/628 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/628 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 196/824 variables, 136/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/824 variables, 148/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/824 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/824 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 273/412 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 57/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 80/492 variables, 36/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 21/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 128/620 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/620 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/628 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/628 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/628 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/824 variables, 136/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/824 variables, 148/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/824 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/824 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2089ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 70 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 311/311 places, 1472/1472 transitions.
RANDOM walk for 4000000 steps (8 resets) in 11636 ms. (343 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3751 ms. (1066 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2028824 steps, run timeout after 12001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 2028824 steps, saw 592256 distinct states, run finished after 12001 ms. (steps per millisecond=169 ) properties seen :0
[2024-06-01 07:12:34] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 07:12:34] [INFO ] Invariant cache hit.
[2024-06-01 07:12:34] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 273/412 variables, 139/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 57/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/492 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 21/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 128/620 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/628 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/628 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 196/824 variables, 136/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/824 variables, 148/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/824 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/824 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/139 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 273/412 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 57/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 80/492 variables, 36/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 21/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 128/620 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/620 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/628 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/628 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/628 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/824 variables, 136/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/824 variables, 148/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/824 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/824 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/824 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1540 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 54 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 311/311 places, 1472/1472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 66 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
[2024-06-01 07:12:37] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 07:12:37] [INFO ] Invariant cache hit.
[2024-06-01 07:12:37] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-06-01 07:12:37] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 07:12:37] [INFO ] Invariant cache hit.
[2024-06-01 07:12:38] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 07:12:39] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2913 ms to find 0 implicit places.
[2024-06-01 07:12:40] [INFO ] Redundant transitions in 149 ms returned []
Running 1465 sub problems to find dead transitions.
[2024-06-01 07:12:40] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 07:12:40] [INFO ] Invariant cache hit.
[2024-06-01 07:12:40] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 3 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 5 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 70 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 80 places in 305 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 55 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:13:05] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 5 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 52 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 68 places in 339 ms of which 4 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 5 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 44 places in 316 ms of which 3 ms to minimize.
[2024-06-01 07:13:08] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 45 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 64 places in 344 ms of which 4 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 45 places in 330 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/824 variables, and 60 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/311 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 62 places in 335 ms of which 4 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 70 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 59 places in 398 ms of which 5 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 5 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 69 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 80 places in 395 ms of which 4 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 52 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 57 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 22 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 54 places in 456 ms of which 5 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 65 places in 432 ms of which 5 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 64 places in 410 ms of which 5 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 10 places in 435 ms of which 5 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 78 places in 429 ms of which 5 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 5 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 66 places in 432 ms of which 4 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 73 places in 415 ms of which 5 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 83 places in 433 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 58 places in 396 ms of which 5 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 39 places in 422 ms of which 7 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 5 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 39 places in 457 ms of which 5 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 45 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 50 places in 335 ms of which 4 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 4 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 4 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 64 places in 497 ms of which 5 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 5 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 72 places in 431 ms of which 5 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 73 places in 425 ms of which 5 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 50 places in 409 ms of which 5 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 5 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 52 places in 315 ms of which 7 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 5 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 68 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 65 places in 313 ms of which 8 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 75 places in 359 ms of which 4 ms to minimize.
SMT process timed out in 61447ms, After SMT, problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 61477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64626 ms. Remains : 311/311 places, 1472/1472 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1327 edges and 311 vertex of which 48 / 311 are part of one of the 7 SCC in 6 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 157 transitions
Ensure Unique test removed 931 transitions
Reduce isomorphic transitions removed 1088 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 270 transition count 323
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 209 transition count 322
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 208 transition count 321
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 126 place count 208 transition count 308
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 157 place count 190 transition count 308
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 323 place count 107 transition count 225
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 363 place count 107 transition count 185
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 373 place count 102 transition count 186
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 377 place count 102 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 381 place count 102 transition count 178
Free-agglomeration rule applied 42 times.
Iterating global reduction 5 with 42 rules applied. Total rules applied 423 place count 102 transition count 136
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 465 place count 60 transition count 136
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 472 place count 60 transition count 136
Applied a total of 472 rules in 96 ms. Remains 60 /311 variables (removed 251) and now considering 136/1472 (removed 1336) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 60 cols
[2024-06-01 07:13:41] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 07:13:41] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 07:13:41] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 07:13:41] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:13:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 07:13:41] [INFO ] [Nat]Absence check using 15 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 07:13:42] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:13:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:13:42] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
TRAPS : Iteration 2
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 3
[2024-06-01 07:13:42] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:13:42] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 746 ms.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 513 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 513 transition count 1680
Applied a total of 22 rules in 60 ms. Remains 513 /524 variables (removed 11) and now considering 1680/1757 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 513/524 places, 1680/1757 transitions.
[2024-06-01 07:13:42] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:13:42] [INFO ] Flatten gal took : 51 ms
[2024-06-01 07:13:42] [INFO ] Input system was already deterministic with 1680 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 1757/1757 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 524 transition count 1750
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 517 transition count 1750
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 517 transition count 1598
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 365 transition count 1598
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 330 place count 353 transition count 1514
Iterating global reduction 2 with 12 rules applied. Total rules applied 342 place count 353 transition count 1514
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 422 place count 313 transition count 1474
Applied a total of 422 rules in 107 ms. Remains 313 /524 variables (removed 211) and now considering 1474/1757 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 313/524 places, 1474/1757 transitions.
[2024-06-01 07:13:42] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:13:42] [INFO ] Flatten gal took : 46 ms
[2024-06-01 07:13:42] [INFO ] Input system was already deterministic with 1474 transitions.
[2024-06-01 07:13:42] [INFO ] Flatten gal took : 51 ms
[2024-06-01 07:13:43] [INFO ] Flatten gal took : 53 ms
[2024-06-01 07:13:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 07:13:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 524 places, 1757 transitions and 8400 arcs took 17 ms.
Total runtime 243177 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-07-CTLFireability-2023-15

BK_STOP 1717226023512

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-07-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1373/ctl_0_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1373/ctl_1_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1373/ctl_2_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1373/ctl_3_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1373/ctl_4_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1373/ctl_5_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1373/ctl_6_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1373/ctl_7_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1373/ctl_8_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1373/ctl_9_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1373/ctl_10_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1373/ctl_11_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1373/ctl_12_
ctl formula name EisenbergMcGuire-PT-07-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1373/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-07"
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-07, 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-171636266300178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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