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.r476-tall-171620505000039.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 CANConstruction-PT-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 CANConstruction-PT-040-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717178792243

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:06:33] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-31 18:06:33] [INFO ] Transformed 3682 places.
[2024-05-31 18:06:33] [INFO ] Transformed 6720 transitions.
[2024-05-31 18:06:33] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (55 resets) in 1779 ms. (22 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
// Phase 1: matrix 6720 rows 3682 cols
[2024-05-31 18:06:35] [INFO ] Computed 81 invariants in 79 ms
[2024-05-31 18:06:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CANConstruction-PT-040-ReachabilityFireability-2024-10 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3418/3642 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3642 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/3682 variables, 40/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3682 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6720/10402 variables, 3682/3763 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10402 variables, 3160/6923 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10402/10402 variables, and 6923 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 3682/3682 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3452/3642 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 18:06:43] [INFO ] Deduced a trap composed of 69 places in 2096 ms of which 145 ms to minimize.
[2024-05-31 18:06:45] [INFO ] Deduced a trap composed of 70 places in 1769 ms of which 24 ms to minimize.
[2024-05-31 18:06:46] [INFO ] Deduced a trap composed of 71 places in 1640 ms of which 16 ms to minimize.
SMT process timed out in 11804ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 190 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 3682 transition count 6555
Reduce places removed 165 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 204 rules applied. Total rules applied 369 place count 3517 transition count 6516
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 408 place count 3478 transition count 6516
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 408 place count 3478 transition count 6489
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 462 place count 3451 transition count 6489
Discarding 1444 places :
Symmetric choice reduction at 3 with 1444 rule applications. Total rules 1906 place count 2007 transition count 3601
Iterating global reduction 3 with 1444 rules applied. Total rules applied 3350 place count 2007 transition count 3601
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 3374 place count 1995 transition count 3589
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3378 place count 1995 transition count 3585
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3382 place count 1991 transition count 3585
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3383 place count 1991 transition count 3584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3384 place count 1990 transition count 3584
Partial Free-agglomeration rule applied 103 times.
Drop transitions (Partial Free agglomeration) removed 103 transitions
Iterating global reduction 5 with 103 rules applied. Total rules applied 3487 place count 1990 transition count 3584
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 3513 place count 1990 transition count 3584
Applied a total of 3513 rules in 1633 ms. Remains 1990 /3682 variables (removed 1692) and now considering 3584/6720 (removed 3136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1642 ms. Remains : 1990/3682 places, 3584/6720 transitions.
RANDOM walk for 40000 steps (121 resets) in 730 ms. (54 steps per ms) remains 4/5 properties
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
// Phase 1: matrix 3584 rows 1990 cols
[2024-05-31 18:06:48] [INFO ] Computed 81 invariants in 24 ms
[2024-05-31 18:06:49] [INFO ] State equation strengthened by 3226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1810/1950 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1950 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/1990 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1990 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3584/5574 variables, 1990/2071 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5574 variables, 3226/5297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5574 variables, 0/5297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/5574 variables, 0/5297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5574/5574 variables, and 5297 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2489 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1990/1990 constraints, ReadFeed: 3226/3226 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1810/1950 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:06:52] [INFO ] Deduced a trap composed of 49 places in 964 ms of which 11 ms to minimize.
[2024-05-31 18:06:53] [INFO ] Deduced a trap composed of 49 places in 899 ms of which 10 ms to minimize.
[2024-05-31 18:06:54] [INFO ] Deduced a trap composed of 48 places in 1099 ms of which 11 ms to minimize.
[2024-05-31 18:06:55] [INFO ] Deduced a trap composed of 46 places in 893 ms of which 10 ms to minimize.
[2024-05-31 18:06:56] [INFO ] Deduced a trap composed of 47 places in 975 ms of which 10 ms to minimize.
[2024-05-31 18:06:57] [INFO ] Deduced a trap composed of 48 places in 908 ms of which 9 ms to minimize.
[2024-05-31 18:06:58] [INFO ] Deduced a trap composed of 43 places in 958 ms of which 10 ms to minimize.
[2024-05-31 18:06:59] [INFO ] Deduced a trap composed of 49 places in 1067 ms of which 10 ms to minimize.
[2024-05-31 18:07:00] [INFO ] Deduced a trap composed of 51 places in 1034 ms of which 11 ms to minimize.
[2024-05-31 18:07:01] [INFO ] Deduced a trap composed of 48 places in 922 ms of which 10 ms to minimize.
[2024-05-31 18:07:02] [INFO ] Deduced a trap composed of 54 places in 1034 ms of which 10 ms to minimize.
[2024-05-31 18:07:04] [INFO ] Deduced a trap composed of 53 places in 1095 ms of which 11 ms to minimize.
[2024-05-31 18:07:05] [INFO ] Deduced a trap composed of 53 places in 1101 ms of which 11 ms to minimize.
[2024-05-31 18:07:06] [INFO ] Deduced a trap composed of 60 places in 897 ms of which 10 ms to minimize.
[2024-05-31 18:07:07] [INFO ] Deduced a trap composed of 48 places in 876 ms of which 10 ms to minimize.
[2024-05-31 18:07:07] [INFO ] Deduced a trap composed of 44 places in 863 ms of which 10 ms to minimize.
[2024-05-31 18:07:09] [INFO ] Deduced a trap composed of 46 places in 1032 ms of which 11 ms to minimize.
[2024-05-31 18:07:09] [INFO ] Deduced a trap composed of 50 places in 786 ms of which 9 ms to minimize.
[2024-05-31 18:07:10] [INFO ] Deduced a trap composed of 46 places in 823 ms of which 10 ms to minimize.
[2024-05-31 18:07:11] [INFO ] Deduced a trap composed of 48 places in 764 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1950 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:07:12] [INFO ] Deduced a trap composed of 50 places in 927 ms of which 10 ms to minimize.
[2024-05-31 18:07:13] [INFO ] Deduced a trap composed of 51 places in 1028 ms of which 11 ms to minimize.
[2024-05-31 18:07:14] [INFO ] Deduced a trap composed of 45 places in 1039 ms of which 11 ms to minimize.
[2024-05-31 18:07:15] [INFO ] Deduced a trap composed of 52 places in 973 ms of which 11 ms to minimize.
[2024-05-31 18:07:16] [INFO ] Deduced a trap composed of 49 places in 969 ms of which 11 ms to minimize.
[2024-05-31 18:07:17] [INFO ] Deduced a trap composed of 50 places in 1021 ms of which 11 ms to minimize.
[2024-05-31 18:07:18] [INFO ] Deduced a trap composed of 50 places in 972 ms of which 10 ms to minimize.
[2024-05-31 18:07:19] [INFO ] Deduced a trap composed of 52 places in 1032 ms of which 11 ms to minimize.
[2024-05-31 18:07:20] [INFO ] Deduced a trap composed of 44 places in 1026 ms of which 11 ms to minimize.
[2024-05-31 18:07:21] [INFO ] Deduced a trap composed of 50 places in 1002 ms of which 11 ms to minimize.
[2024-05-31 18:07:22] [INFO ] Deduced a trap composed of 54 places in 1020 ms of which 10 ms to minimize.
[2024-05-31 18:07:23] [INFO ] Deduced a trap composed of 46 places in 1045 ms of which 15 ms to minimize.
[2024-05-31 18:07:24] [INFO ] Deduced a trap composed of 47 places in 937 ms of which 11 ms to minimize.
[2024-05-31 18:07:25] [INFO ] Deduced a trap composed of 46 places in 922 ms of which 10 ms to minimize.
[2024-05-31 18:07:26] [INFO ] Deduced a trap composed of 50 places in 1029 ms of which 11 ms to minimize.
[2024-05-31 18:07:27] [INFO ] Deduced a trap composed of 47 places in 999 ms of which 11 ms to minimize.
[2024-05-31 18:07:28] [INFO ] Deduced a trap composed of 46 places in 916 ms of which 12 ms to minimize.
[2024-05-31 18:07:29] [INFO ] Deduced a trap composed of 47 places in 996 ms of which 11 ms to minimize.
[2024-05-31 18:07:30] [INFO ] Deduced a trap composed of 48 places in 1021 ms of which 11 ms to minimize.
[2024-05-31 18:07:32] [INFO ] Deduced a trap composed of 45 places in 1040 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:07:32] [INFO ] Deduced a trap composed of 46 places in 863 ms of which 10 ms to minimize.
[2024-05-31 18:07:34] [INFO ] Deduced a trap composed of 45 places in 1045 ms of which 10 ms to minimize.
[2024-05-31 18:07:34] [INFO ] Deduced a trap composed of 49 places in 820 ms of which 9 ms to minimize.
[2024-05-31 18:07:35] [INFO ] Deduced a trap composed of 49 places in 902 ms of which 11 ms to minimize.
[2024-05-31 18:07:36] [INFO ] Deduced a trap composed of 46 places in 910 ms of which 10 ms to minimize.
SMT process timed out in 47803ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 140 out of 1990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1990/1990 places, 3584/3584 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1990 transition count 3582
Reduce places removed 2 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 1988 transition count 3572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 24 place count 1978 transition count 3572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 1978 transition count 3571
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 1977 transition count 3571
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 1973 transition count 3563
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 1973 transition count 3563
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 76 place count 1952 transition count 3542
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 1949 transition count 3543
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 1949 transition count 3543
Applied a total of 86 rules in 760 ms. Remains 1949 /1990 variables (removed 41) and now considering 3543/3584 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 1949/1990 places, 3543/3584 transitions.
RANDOM walk for 40000 steps (128 resets) in 745 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 120721 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 120721 steps, saw 45106 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 3543 rows 1949 cols
[2024-05-31 18:07:40] [INFO ] Computed 81 invariants in 17 ms
[2024-05-31 18:07:40] [INFO ] State equation strengthened by 3250 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1769/1909 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1909 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/1949 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1949 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3543/5492 variables, 1949/2030 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5492 variables, 3250/5280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5492 variables, 0/5280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/5492 variables, 0/5280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5492/5492 variables, and 5280 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2373 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1949/1949 constraints, ReadFeed: 3250/3250 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1769/1909 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:07:44] [INFO ] Deduced a trap composed of 47 places in 1120 ms of which 10 ms to minimize.
[2024-05-31 18:07:45] [INFO ] Deduced a trap composed of 48 places in 1139 ms of which 11 ms to minimize.
[2024-05-31 18:07:46] [INFO ] Deduced a trap composed of 48 places in 965 ms of which 10 ms to minimize.
[2024-05-31 18:07:47] [INFO ] Deduced a trap composed of 48 places in 1048 ms of which 11 ms to minimize.
[2024-05-31 18:07:48] [INFO ] Deduced a trap composed of 44 places in 913 ms of which 10 ms to minimize.
[2024-05-31 18:07:49] [INFO ] Deduced a trap composed of 44 places in 865 ms of which 10 ms to minimize.
[2024-05-31 18:07:50] [INFO ] Deduced a trap composed of 50 places in 886 ms of which 10 ms to minimize.
[2024-05-31 18:07:51] [INFO ] Deduced a trap composed of 46 places in 1008 ms of which 15 ms to minimize.
[2024-05-31 18:07:52] [INFO ] Deduced a trap composed of 46 places in 903 ms of which 12 ms to minimize.
[2024-05-31 18:07:53] [INFO ] Deduced a trap composed of 50 places in 1074 ms of which 11 ms to minimize.
[2024-05-31 18:07:54] [INFO ] Deduced a trap composed of 46 places in 888 ms of which 10 ms to minimize.
[2024-05-31 18:07:55] [INFO ] Deduced a trap composed of 49 places in 883 ms of which 10 ms to minimize.
[2024-05-31 18:07:56] [INFO ] Deduced a trap composed of 50 places in 1053 ms of which 11 ms to minimize.
[2024-05-31 18:07:57] [INFO ] Deduced a trap composed of 43 places in 888 ms of which 10 ms to minimize.
[2024-05-31 18:07:58] [INFO ] Deduced a trap composed of 51 places in 868 ms of which 10 ms to minimize.
[2024-05-31 18:07:59] [INFO ] Deduced a trap composed of 51 places in 879 ms of which 10 ms to minimize.
[2024-05-31 18:08:00] [INFO ] Deduced a trap composed of 49 places in 898 ms of which 10 ms to minimize.
[2024-05-31 18:08:01] [INFO ] Deduced a trap composed of 47 places in 965 ms of which 10 ms to minimize.
[2024-05-31 18:08:02] [INFO ] Deduced a trap composed of 47 places in 786 ms of which 9 ms to minimize.
[2024-05-31 18:08:03] [INFO ] Deduced a trap composed of 54 places in 880 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1909 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:08:03] [INFO ] Deduced a trap composed of 53 places in 777 ms of which 9 ms to minimize.
[2024-05-31 18:08:04] [INFO ] Deduced a trap composed of 53 places in 987 ms of which 10 ms to minimize.
[2024-05-31 18:08:05] [INFO ] Deduced a trap composed of 56 places in 809 ms of which 10 ms to minimize.
[2024-05-31 18:08:06] [INFO ] Deduced a trap composed of 47 places in 756 ms of which 10 ms to minimize.
[2024-05-31 18:08:07] [INFO ] Deduced a trap composed of 47 places in 810 ms of which 10 ms to minimize.
[2024-05-31 18:08:08] [INFO ] Deduced a trap composed of 50 places in 731 ms of which 10 ms to minimize.
[2024-05-31 18:08:09] [INFO ] Deduced a trap composed of 49 places in 795 ms of which 10 ms to minimize.
[2024-05-31 18:08:09] [INFO ] Deduced a trap composed of 45 places in 940 ms of which 11 ms to minimize.
[2024-05-31 18:08:10] [INFO ] Deduced a trap composed of 56 places in 781 ms of which 9 ms to minimize.
[2024-05-31 18:08:11] [INFO ] Deduced a trap composed of 46 places in 1052 ms of which 10 ms to minimize.
[2024-05-31 18:08:12] [INFO ] Deduced a trap composed of 51 places in 886 ms of which 10 ms to minimize.
[2024-05-31 18:08:13] [INFO ] Deduced a trap composed of 44 places in 721 ms of which 9 ms to minimize.
[2024-05-31 18:08:14] [INFO ] Deduced a trap composed of 44 places in 750 ms of which 9 ms to minimize.
[2024-05-31 18:08:15] [INFO ] Deduced a trap composed of 50 places in 811 ms of which 10 ms to minimize.
[2024-05-31 18:08:16] [INFO ] Deduced a trap composed of 49 places in 963 ms of which 10 ms to minimize.
[2024-05-31 18:08:17] [INFO ] Deduced a trap composed of 49 places in 989 ms of which 10 ms to minimize.
[2024-05-31 18:08:18] [INFO ] Deduced a trap composed of 51 places in 873 ms of which 10 ms to minimize.
[2024-05-31 18:08:19] [INFO ] Deduced a trap composed of 50 places in 929 ms of which 10 ms to minimize.
[2024-05-31 18:08:19] [INFO ] Deduced a trap composed of 44 places in 868 ms of which 10 ms to minimize.
[2024-05-31 18:08:20] [INFO ] Deduced a trap composed of 44 places in 950 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1909 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:08:21] [INFO ] Deduced a trap composed of 54 places in 863 ms of which 9 ms to minimize.
[2024-05-31 18:08:22] [INFO ] Deduced a trap composed of 49 places in 969 ms of which 11 ms to minimize.
[2024-05-31 18:08:23] [INFO ] Deduced a trap composed of 45 places in 795 ms of which 9 ms to minimize.
[2024-05-31 18:08:24] [INFO ] Deduced a trap composed of 48 places in 867 ms of which 9 ms to minimize.
[2024-05-31 18:08:25] [INFO ] Deduced a trap composed of 50 places in 978 ms of which 10 ms to minimize.
[2024-05-31 18:08:26] [INFO ] Deduced a trap composed of 45 places in 968 ms of which 11 ms to minimize.
[2024-05-31 18:08:27] [INFO ] Deduced a trap composed of 50 places in 857 ms of which 10 ms to minimize.
[2024-05-31 18:08:28] [INFO ] Deduced a trap composed of 52 places in 791 ms of which 9 ms to minimize.
[2024-05-31 18:08:29] [INFO ] Deduced a trap composed of 46 places in 802 ms of which 9 ms to minimize.
[2024-05-31 18:08:30] [INFO ] Deduced a trap composed of 47 places in 898 ms of which 9 ms to minimize.
[2024-05-31 18:08:30] [INFO ] Deduced a trap composed of 50 places in 779 ms of which 9 ms to minimize.
[2024-05-31 18:08:31] [INFO ] Deduced a trap composed of 49 places in 1019 ms of which 10 ms to minimize.
[2024-05-31 18:08:32] [INFO ] Deduced a trap composed of 47 places in 1039 ms of which 11 ms to minimize.
[2024-05-31 18:08:34] [INFO ] Deduced a trap composed of 46 places in 1060 ms of which 11 ms to minimize.
[2024-05-31 18:08:34] [INFO ] Deduced a trap composed of 55 places in 832 ms of which 10 ms to minimize.
[2024-05-31 18:08:36] [INFO ] Deduced a trap composed of 49 places in 1036 ms of which 12 ms to minimize.
[2024-05-31 18:08:37] [INFO ] Deduced a trap composed of 44 places in 1048 ms of which 10 ms to minimize.
[2024-05-31 18:08:38] [INFO ] Deduced a trap composed of 43 places in 1063 ms of which 11 ms to minimize.
[2024-05-31 18:08:39] [INFO ] Deduced a trap composed of 44 places in 812 ms of which 9 ms to minimize.
[2024-05-31 18:08:39] [INFO ] Deduced a trap composed of 50 places in 904 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1909 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:08:41] [INFO ] Deduced a trap composed of 43 places in 1048 ms of which 11 ms to minimize.
[2024-05-31 18:08:42] [INFO ] Deduced a trap composed of 52 places in 997 ms of which 11 ms to minimize.
[2024-05-31 18:08:43] [INFO ] Deduced a trap composed of 47 places in 1002 ms of which 10 ms to minimize.
[2024-05-31 18:08:44] [INFO ] Deduced a trap composed of 49 places in 872 ms of which 10 ms to minimize.
[2024-05-31 18:08:45] [INFO ] Deduced a trap composed of 54 places in 1025 ms of which 11 ms to minimize.
[2024-05-31 18:08:45] [INFO ] Deduced a trap composed of 47 places in 784 ms of which 9 ms to minimize.
[2024-05-31 18:08:46] [INFO ] Deduced a trap composed of 52 places in 943 ms of which 11 ms to minimize.
[2024-05-31 18:08:47] [INFO ] Deduced a trap composed of 46 places in 789 ms of which 9 ms to minimize.
[2024-05-31 18:08:48] [INFO ] Deduced a trap composed of 45 places in 837 ms of which 9 ms to minimize.
[2024-05-31 18:08:49] [INFO ] Deduced a trap composed of 48 places in 844 ms of which 10 ms to minimize.
[2024-05-31 18:08:50] [INFO ] Deduced a trap composed of 47 places in 998 ms of which 10 ms to minimize.
[2024-05-31 18:08:51] [INFO ] Deduced a trap composed of 48 places in 995 ms of which 11 ms to minimize.
[2024-05-31 18:08:52] [INFO ] Deduced a trap composed of 45 places in 863 ms of which 10 ms to minimize.
[2024-05-31 18:08:53] [INFO ] Deduced a trap composed of 54 places in 852 ms of which 9 ms to minimize.
[2024-05-31 18:08:54] [INFO ] Deduced a trap composed of 44 places in 1039 ms of which 11 ms to minimize.
[2024-05-31 18:08:55] [INFO ] Deduced a trap composed of 53 places in 907 ms of which 10 ms to minimize.
[2024-05-31 18:08:56] [INFO ] Deduced a trap composed of 45 places in 795 ms of which 10 ms to minimize.
[2024-05-31 18:08:57] [INFO ] Deduced a trap composed of 49 places in 917 ms of which 10 ms to minimize.
[2024-05-31 18:08:58] [INFO ] Deduced a trap composed of 44 places in 1088 ms of which 11 ms to minimize.
[2024-05-31 18:08:59] [INFO ] Deduced a trap composed of 44 places in 1081 ms of which 12 ms to minimize.
SMT process timed out in 78545ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 140 out of 1949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1949/1949 places, 3543/3543 transitions.
Applied a total of 0 rules in 124 ms. Remains 1949 /1949 variables (removed 0) and now considering 3543/3543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1949/1949 places, 3543/3543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1949/1949 places, 3543/3543 transitions.
Applied a total of 0 rules in 129 ms. Remains 1949 /1949 variables (removed 0) and now considering 3543/3543 (removed 0) transitions.
[2024-05-31 18:08:59] [INFO ] Invariant cache hit.
[2024-05-31 18:09:00] [INFO ] Implicit Places using invariants in 986 ms returned [8, 15, 23, 30, 36, 43, 51, 59, 65, 72, 80, 88, 95, 103, 109, 117, 124, 132, 139, 147, 155, 162, 169, 176, 182, 190, 198, 206, 214, 220, 228, 237, 245, 253, 259, 265, 269, 275, 282, 289]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 995 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1909/1949 places, 3543/3543 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1909 transition count 3532
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1898 transition count 3532
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 71 place count 1849 transition count 3483
Iterating global reduction 2 with 49 rules applied. Total rules applied 120 place count 1849 transition count 3483
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 148 place count 1835 transition count 3469
Applied a total of 148 rules in 334 ms. Remains 1835 /1909 variables (removed 74) and now considering 3469/3543 (removed 74) transitions.
// Phase 1: matrix 3469 rows 1835 cols
[2024-05-31 18:09:01] [INFO ] Computed 41 invariants in 41 ms
[2024-05-31 18:09:01] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-05-31 18:09:01] [INFO ] Invariant cache hit.
[2024-05-31 18:09:02] [INFO ] State equation strengthened by 3180 read => feed constraints.
[2024-05-31 18:09:22] [INFO ] Implicit Places using invariants and state equation in 20403 ms returned []
Implicit Place search using SMT with State Equation took 21262 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1835/1949 places, 3469/3543 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22721 ms. Remains : 1835/1949 places, 3469/3543 transitions.
RANDOM walk for 40000 steps (128 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 120915 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 120915 steps, saw 45347 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-31 18:09:25] [INFO ] Invariant cache hit.
[2024-05-31 18:09:25] [INFO ] State equation strengthened by 3180 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1695/1835 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3469/5304 variables, 1835/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5304 variables, 3180/5056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5304 variables, 0/5056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/5304 variables, 0/5056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5304/5304 variables, and 5056 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 1835/1835 constraints, ReadFeed: 3180/3180 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1695/1835 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:09:28] [INFO ] Deduced a trap composed of 45 places in 830 ms of which 10 ms to minimize.
[2024-05-31 18:09:29] [INFO ] Deduced a trap composed of 49 places in 965 ms of which 10 ms to minimize.
[2024-05-31 18:09:30] [INFO ] Deduced a trap composed of 45 places in 825 ms of which 10 ms to minimize.
[2024-05-31 18:09:31] [INFO ] Deduced a trap composed of 44 places in 864 ms of which 10 ms to minimize.
[2024-05-31 18:09:32] [INFO ] Deduced a trap composed of 45 places in 817 ms of which 10 ms to minimize.
[2024-05-31 18:09:33] [INFO ] Deduced a trap composed of 47 places in 785 ms of which 9 ms to minimize.
[2024-05-31 18:09:33] [INFO ] Deduced a trap composed of 47 places in 761 ms of which 9 ms to minimize.
[2024-05-31 18:09:34] [INFO ] Deduced a trap composed of 45 places in 806 ms of which 9 ms to minimize.
[2024-05-31 18:09:35] [INFO ] Deduced a trap composed of 49 places in 823 ms of which 9 ms to minimize.
[2024-05-31 18:09:36] [INFO ] Deduced a trap composed of 44 places in 831 ms of which 10 ms to minimize.
[2024-05-31 18:09:37] [INFO ] Deduced a trap composed of 44 places in 803 ms of which 10 ms to minimize.
[2024-05-31 18:09:38] [INFO ] Deduced a trap composed of 45 places in 922 ms of which 10 ms to minimize.
[2024-05-31 18:09:38] [INFO ] Deduced a trap composed of 45 places in 766 ms of which 9 ms to minimize.
[2024-05-31 18:09:39] [INFO ] Deduced a trap composed of 43 places in 916 ms of which 10 ms to minimize.
[2024-05-31 18:09:40] [INFO ] Deduced a trap composed of 47 places in 791 ms of which 11 ms to minimize.
[2024-05-31 18:09:41] [INFO ] Deduced a trap composed of 44 places in 741 ms of which 9 ms to minimize.
[2024-05-31 18:09:42] [INFO ] Deduced a trap composed of 44 places in 872 ms of which 10 ms to minimize.
[2024-05-31 18:09:43] [INFO ] Deduced a trap composed of 44 places in 873 ms of which 10 ms to minimize.
[2024-05-31 18:09:44] [INFO ] Deduced a trap composed of 48 places in 730 ms of which 10 ms to minimize.
[2024-05-31 18:09:44] [INFO ] Deduced a trap composed of 44 places in 869 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:09:45] [INFO ] Deduced a trap composed of 45 places in 834 ms of which 9 ms to minimize.
[2024-05-31 18:09:46] [INFO ] Deduced a trap composed of 45 places in 837 ms of which 10 ms to minimize.
[2024-05-31 18:09:47] [INFO ] Deduced a trap composed of 45 places in 839 ms of which 10 ms to minimize.
[2024-05-31 18:09:48] [INFO ] Deduced a trap composed of 48 places in 811 ms of which 10 ms to minimize.
[2024-05-31 18:09:49] [INFO ] Deduced a trap composed of 44 places in 793 ms of which 9 ms to minimize.
[2024-05-31 18:09:50] [INFO ] Deduced a trap composed of 50 places in 793 ms of which 9 ms to minimize.
[2024-05-31 18:09:50] [INFO ] Deduced a trap composed of 47 places in 736 ms of which 10 ms to minimize.
[2024-05-31 18:09:51] [INFO ] Deduced a trap composed of 46 places in 683 ms of which 9 ms to minimize.
[2024-05-31 18:09:52] [INFO ] Deduced a trap composed of 50 places in 866 ms of which 10 ms to minimize.
[2024-05-31 18:09:53] [INFO ] Deduced a trap composed of 44 places in 732 ms of which 8 ms to minimize.
[2024-05-31 18:09:53] [INFO ] Deduced a trap composed of 44 places in 738 ms of which 9 ms to minimize.
[2024-05-31 18:09:54] [INFO ] Deduced a trap composed of 51 places in 763 ms of which 9 ms to minimize.
[2024-05-31 18:09:55] [INFO ] Deduced a trap composed of 44 places in 659 ms of which 8 ms to minimize.
[2024-05-31 18:09:56] [INFO ] Deduced a trap composed of 44 places in 654 ms of which 9 ms to minimize.
[2024-05-31 18:09:56] [INFO ] Deduced a trap composed of 44 places in 774 ms of which 9 ms to minimize.
[2024-05-31 18:09:57] [INFO ] Deduced a trap composed of 51 places in 730 ms of which 9 ms to minimize.
[2024-05-31 18:09:58] [INFO ] Deduced a trap composed of 44 places in 736 ms of which 9 ms to minimize.
[2024-05-31 18:09:59] [INFO ] Deduced a trap composed of 45 places in 763 ms of which 10 ms to minimize.
[2024-05-31 18:09:59] [INFO ] Deduced a trap composed of 44 places in 695 ms of which 8 ms to minimize.
[2024-05-31 18:10:00] [INFO ] Deduced a trap composed of 46 places in 627 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:10:01] [INFO ] Deduced a trap composed of 44 places in 878 ms of which 9 ms to minimize.
[2024-05-31 18:10:02] [INFO ] Deduced a trap composed of 46 places in 767 ms of which 8 ms to minimize.
[2024-05-31 18:10:03] [INFO ] Deduced a trap composed of 46 places in 698 ms of which 9 ms to minimize.
[2024-05-31 18:10:03] [INFO ] Deduced a trap composed of 44 places in 776 ms of which 9 ms to minimize.
[2024-05-31 18:10:04] [INFO ] Deduced a trap composed of 44 places in 1026 ms of which 10 ms to minimize.
[2024-05-31 18:10:05] [INFO ] Deduced a trap composed of 44 places in 806 ms of which 9 ms to minimize.
[2024-05-31 18:10:06] [INFO ] Deduced a trap composed of 44 places in 913 ms of which 11 ms to minimize.
[2024-05-31 18:10:07] [INFO ] Deduced a trap composed of 51 places in 841 ms of which 9 ms to minimize.
[2024-05-31 18:10:08] [INFO ] Deduced a trap composed of 53 places in 765 ms of which 9 ms to minimize.
[2024-05-31 18:10:09] [INFO ] Deduced a trap composed of 49 places in 842 ms of which 10 ms to minimize.
[2024-05-31 18:10:10] [INFO ] Deduced a trap composed of 48 places in 954 ms of which 10 ms to minimize.
[2024-05-31 18:10:11] [INFO ] Deduced a trap composed of 46 places in 854 ms of which 9 ms to minimize.
[2024-05-31 18:10:12] [INFO ] Deduced a trap composed of 46 places in 939 ms of which 10 ms to minimize.
[2024-05-31 18:10:13] [INFO ] Deduced a trap composed of 46 places in 919 ms of which 10 ms to minimize.
[2024-05-31 18:10:14] [INFO ] Deduced a trap composed of 44 places in 1005 ms of which 10 ms to minimize.
[2024-05-31 18:10:15] [INFO ] Deduced a trap composed of 55 places in 1015 ms of which 9 ms to minimize.
[2024-05-31 18:10:16] [INFO ] Deduced a trap composed of 49 places in 915 ms of which 9 ms to minimize.
[2024-05-31 18:10:16] [INFO ] Deduced a trap composed of 47 places in 841 ms of which 9 ms to minimize.
[2024-05-31 18:10:17] [INFO ] Deduced a trap composed of 49 places in 804 ms of which 9 ms to minimize.
[2024-05-31 18:10:18] [INFO ] Deduced a trap composed of 47 places in 805 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:10:19] [INFO ] Deduced a trap composed of 45 places in 739 ms of which 9 ms to minimize.
[2024-05-31 18:10:20] [INFO ] Deduced a trap composed of 48 places in 864 ms of which 10 ms to minimize.
[2024-05-31 18:10:21] [INFO ] Deduced a trap composed of 54 places in 749 ms of which 9 ms to minimize.
[2024-05-31 18:10:21] [INFO ] Deduced a trap composed of 48 places in 754 ms of which 9 ms to minimize.
[2024-05-31 18:10:22] [INFO ] Deduced a trap composed of 53 places in 750 ms of which 9 ms to minimize.
[2024-05-31 18:10:23] [INFO ] Deduced a trap composed of 46 places in 912 ms of which 10 ms to minimize.
[2024-05-31 18:10:24] [INFO ] Deduced a trap composed of 45 places in 902 ms of which 10 ms to minimize.
[2024-05-31 18:10:25] [INFO ] Deduced a trap composed of 46 places in 795 ms of which 9 ms to minimize.
[2024-05-31 18:10:26] [INFO ] Deduced a trap composed of 49 places in 665 ms of which 9 ms to minimize.
[2024-05-31 18:10:26] [INFO ] Deduced a trap composed of 44 places in 686 ms of which 9 ms to minimize.
[2024-05-31 18:10:27] [INFO ] Deduced a trap composed of 45 places in 891 ms of which 10 ms to minimize.
[2024-05-31 18:10:28] [INFO ] Deduced a trap composed of 44 places in 710 ms of which 9 ms to minimize.
[2024-05-31 18:10:29] [INFO ] Deduced a trap composed of 47 places in 901 ms of which 10 ms to minimize.
[2024-05-31 18:10:30] [INFO ] Deduced a trap composed of 45 places in 725 ms of which 9 ms to minimize.
[2024-05-31 18:10:31] [INFO ] Deduced a trap composed of 43 places in 903 ms of which 9 ms to minimize.
[2024-05-31 18:10:31] [INFO ] Deduced a trap composed of 46 places in 892 ms of which 9 ms to minimize.
[2024-05-31 18:10:32] [INFO ] Deduced a trap composed of 46 places in 767 ms of which 10 ms to minimize.
[2024-05-31 18:10:33] [INFO ] Deduced a trap composed of 48 places in 856 ms of which 9 ms to minimize.
[2024-05-31 18:10:34] [INFO ] Deduced a trap composed of 45 places in 709 ms of which 9 ms to minimize.
[2024-05-31 18:10:35] [INFO ] Deduced a trap composed of 46 places in 707 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1835 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:10:35] [INFO ] Deduced a trap composed of 45 places in 759 ms of which 8 ms to minimize.
[2024-05-31 18:10:36] [INFO ] Deduced a trap composed of 51 places in 716 ms of which 9 ms to minimize.
[2024-05-31 18:10:37] [INFO ] Deduced a trap composed of 44 places in 857 ms of which 9 ms to minimize.
[2024-05-31 18:10:38] [INFO ] Deduced a trap composed of 44 places in 767 ms of which 9 ms to minimize.
[2024-05-31 18:10:39] [INFO ] Deduced a trap composed of 43 places in 879 ms of which 9 ms to minimize.
[2024-05-31 18:10:40] [INFO ] Deduced a trap composed of 50 places in 866 ms of which 10 ms to minimize.
[2024-05-31 18:10:41] [INFO ] Deduced a trap composed of 48 places in 883 ms of which 10 ms to minimize.
[2024-05-31 18:10:41] [INFO ] Deduced a trap composed of 44 places in 697 ms of which 9 ms to minimize.
[2024-05-31 18:10:42] [INFO ] Deduced a trap composed of 50 places in 885 ms of which 9 ms to minimize.
[2024-05-31 18:10:43] [INFO ] Deduced a trap composed of 45 places in 825 ms of which 10 ms to minimize.
[2024-05-31 18:10:44] [INFO ] Deduced a trap composed of 51 places in 769 ms of which 9 ms to minimize.
[2024-05-31 18:10:45] [INFO ] Deduced a trap composed of 45 places in 810 ms of which 10 ms to minimize.
[2024-05-31 18:10:46] [INFO ] Deduced a trap composed of 53 places in 764 ms of which 9 ms to minimize.
[2024-05-31 18:10:46] [INFO ] Deduced a trap composed of 45 places in 842 ms of which 9 ms to minimize.
[2024-05-31 18:10:47] [INFO ] Deduced a trap composed of 51 places in 760 ms of which 9 ms to minimize.
[2024-05-31 18:10:48] [INFO ] Deduced a trap composed of 44 places in 833 ms of which 10 ms to minimize.
[2024-05-31 18:10:49] [INFO ] Deduced a trap composed of 48 places in 755 ms of which 9 ms to minimize.
[2024-05-31 18:10:50] [INFO ] Deduced a trap composed of 46 places in 836 ms of which 9 ms to minimize.
[2024-05-31 18:10:51] [INFO ] Deduced a trap composed of 48 places in 789 ms of which 10 ms to minimize.
[2024-05-31 18:10:51] [INFO ] Deduced a trap composed of 44 places in 791 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1835 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:10:52] [INFO ] Deduced a trap composed of 51 places in 696 ms of which 9 ms to minimize.
[2024-05-31 18:10:53] [INFO ] Deduced a trap composed of 45 places in 772 ms of which 10 ms to minimize.
[2024-05-31 18:10:54] [INFO ] Deduced a trap composed of 45 places in 777 ms of which 10 ms to minimize.
[2024-05-31 18:10:55] [INFO ] Deduced a trap composed of 47 places in 741 ms of which 10 ms to minimize.
[2024-05-31 18:10:55] [INFO ] Deduced a trap composed of 52 places in 637 ms of which 8 ms to minimize.
[2024-05-31 18:10:56] [INFO ] Deduced a trap composed of 44 places in 819 ms of which 10 ms to minimize.
[2024-05-31 18:10:57] [INFO ] Deduced a trap composed of 44 places in 782 ms of which 9 ms to minimize.
[2024-05-31 18:10:58] [INFO ] Deduced a trap composed of 52 places in 782 ms of which 10 ms to minimize.
SMT process timed out in 92739ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 140 out of 1835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1835/1835 places, 3469/3469 transitions.
Applied a total of 0 rules in 138 ms. Remains 1835 /1835 variables (removed 0) and now considering 3469/3469 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1835/1835 places, 3469/3469 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1835/1835 places, 3469/3469 transitions.
Applied a total of 0 rules in 134 ms. Remains 1835 /1835 variables (removed 0) and now considering 3469/3469 (removed 0) transitions.
[2024-05-31 18:10:58] [INFO ] Invariant cache hit.
[2024-05-31 18:10:59] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-05-31 18:10:59] [INFO ] Invariant cache hit.
[2024-05-31 18:11:00] [INFO ] State equation strengthened by 3180 read => feed constraints.
[2024-05-31 18:11:18] [INFO ] Implicit Places using invariants and state equation in 19718 ms returned []
Implicit Place search using SMT with State Equation took 20506 ms to find 0 implicit places.
[2024-05-31 18:11:19] [INFO ] Redundant transitions in 228 ms returned []
Running 3429 sub problems to find dead transitions.
[2024-05-31 18:11:19] [INFO ] Invariant cache hit.
[2024-05-31 18:11:19] [INFO ] State equation strengthened by 3180 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1834 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1834/5304 variables, and 41 constraints, problems are : Problem set: 0 solved, 3429 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1835 constraints, ReadFeed: 0/3180 constraints, PredecessorRefiner: 3429/3429 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1834 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3429 unsolved
[2024-05-31 18:11:54] [INFO ] Deduced a trap composed of 50 places in 678 ms of which 9 ms to minimize.
[2024-05-31 18:11:54] [INFO ] Deduced a trap composed of 45 places in 634 ms of which 9 ms to minimize.
[2024-05-31 18:11:55] [INFO ] Deduced a trap composed of 54 places in 660 ms of which 9 ms to minimize.
[2024-05-31 18:11:56] [INFO ] Deduced a trap composed of 43 places in 684 ms of which 9 ms to minimize.
[2024-05-31 18:11:56] [INFO ] Deduced a trap composed of 43 places in 643 ms of which 9 ms to minimize.
[2024-05-31 18:11:57] [INFO ] Deduced a trap composed of 44 places in 674 ms of which 9 ms to minimize.
[2024-05-31 18:11:58] [INFO ] Deduced a trap composed of 43 places in 671 ms of which 9 ms to minimize.
[2024-05-31 18:11:58] [INFO ] Deduced a trap composed of 43 places in 678 ms of which 9 ms to minimize.
[2024-05-31 18:11:59] [INFO ] Deduced a trap composed of 56 places in 659 ms of which 8 ms to minimize.
[2024-05-31 18:12:00] [INFO ] Deduced a trap composed of 49 places in 654 ms of which 8 ms to minimize.
[2024-05-31 18:12:00] [INFO ] Deduced a trap composed of 49 places in 651 ms of which 9 ms to minimize.
[2024-05-31 18:12:01] [INFO ] Deduced a trap composed of 46 places in 651 ms of which 9 ms to minimize.
[2024-05-31 18:12:02] [INFO ] Deduced a trap composed of 52 places in 607 ms of which 9 ms to minimize.
[2024-05-31 18:12:02] [INFO ] Deduced a trap composed of 46 places in 576 ms of which 8 ms to minimize.
[2024-05-31 18:12:03] [INFO ] Deduced a trap composed of 44 places in 572 ms of which 9 ms to minimize.
[2024-05-31 18:12:04] [INFO ] Deduced a trap composed of 45 places in 602 ms of which 8 ms to minimize.
[2024-05-31 18:12:04] [INFO ] Deduced a trap composed of 45 places in 610 ms of which 9 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 48 places in 602 ms of which 9 ms to minimize.
[2024-05-31 18:12:05] [INFO ] Deduced a trap composed of 48 places in 535 ms of which 8 ms to minimize.
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 49 places in 587 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1834 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3429 unsolved
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 45 places in 581 ms of which 8 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 44 places in 547 ms of which 9 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 52 places in 560 ms of which 9 ms to minimize.
[2024-05-31 18:12:10] [INFO ] Deduced a trap composed of 53 places in 561 ms of which 8 ms to minimize.
[2024-05-31 18:12:10] [INFO ] Deduced a trap composed of 45 places in 528 ms of which 9 ms to minimize.
[2024-05-31 18:12:11] [INFO ] Deduced a trap composed of 43 places in 510 ms of which 8 ms to minimize.
[2024-05-31 18:12:11] [INFO ] Deduced a trap composed of 44 places in 542 ms of which 8 ms to minimize.
[2024-05-31 18:12:12] [INFO ] Deduced a trap composed of 53 places in 535 ms of which 8 ms to minimize.
[2024-05-31 18:12:13] [INFO ] Deduced a trap composed of 50 places in 558 ms of which 8 ms to minimize.
[2024-05-31 18:12:13] [INFO ] Deduced a trap composed of 44 places in 510 ms of which 7 ms to minimize.
[2024-05-31 18:12:14] [INFO ] Deduced a trap composed of 43 places in 514 ms of which 9 ms to minimize.
[2024-05-31 18:12:14] [INFO ] Deduced a trap composed of 43 places in 480 ms of which 7 ms to minimize.
[2024-05-31 18:12:15] [INFO ] Deduced a trap composed of 43 places in 498 ms of which 8 ms to minimize.
[2024-05-31 18:12:15] [INFO ] Deduced a trap composed of 43 places in 513 ms of which 8 ms to minimize.
[2024-05-31 18:12:16] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 8 ms to minimize.
[2024-05-31 18:12:16] [INFO ] Deduced a trap composed of 46 places in 467 ms of which 8 ms to minimize.
[2024-05-31 18:12:17] [INFO ] Deduced a trap composed of 46 places in 459 ms of which 8 ms to minimize.
[2024-05-31 18:12:17] [INFO ] Deduced a trap composed of 46 places in 473 ms of which 7 ms to minimize.
[2024-05-31 18:12:18] [INFO ] Deduced a trap composed of 46 places in 474 ms of which 8 ms to minimize.
[2024-05-31 18:12:18] [INFO ] Deduced a trap composed of 46 places in 472 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1834 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 3429 unsolved
[2024-05-31 18:12:20] [INFO ] Deduced a trap composed of 51 places in 563 ms of which 8 ms to minimize.
[2024-05-31 18:12:21] [INFO ] Deduced a trap composed of 44 places in 536 ms of which 8 ms to minimize.
[2024-05-31 18:12:21] [INFO ] Deduced a trap composed of 44 places in 493 ms of which 8 ms to minimize.
SMT process timed out in 62650ms, After SMT, problems are : Problem set: 0 solved, 3429 unsolved
Search for dead transitions found 0 dead transitions in 62681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83577 ms. Remains : 1835/1835 places, 3469/3469 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2314 edges and 1835 vertex of which 663 / 1835 are part of one of the 17 SCC in 6 ms
Free SCC test removed 646 places
Drop transitions (Empty/Sink Transition effects.) removed 1275 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1276 transitions.
Graph (complete) has 2331 edges and 1189 vertex of which 1177 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 1177 transition count 2074
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Performed 727 Post agglomeration using F-continuation condition.Transition count delta: 727
Iterating post reduction 1 with 940 rules applied. Total rules applied 1060 place count 1069 transition count 1242
Reduce places removed 727 places and 0 transitions.
Ensure Unique test removed 706 transitions
Reduce isomorphic transitions removed 706 transitions.
Iterating post reduction 2 with 1433 rules applied. Total rules applied 2493 place count 342 transition count 536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2493 place count 342 transition count 535
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2495 place count 341 transition count 535
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2501 place count 335 transition count 525
Iterating global reduction 3 with 6 rules applied. Total rules applied 2507 place count 335 transition count 525
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2512 place count 335 transition count 520
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2532 place count 325 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2536 place count 323 transition count 512
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 2554 place count 323 transition count 494
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 4 with 1 rules applied. Total rules applied 2555 place count 323 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2556 place count 322 transition count 493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2558 place count 321 transition count 493
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 2579 place count 321 transition count 472
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2600 place count 300 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2602 place count 300 transition count 470
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 2632 place count 300 transition count 470
Applied a total of 2632 rules in 201 ms. Remains 300 /1835 variables (removed 1535) and now considering 470/3469 (removed 2999) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 470 rows 300 cols
[2024-05-31 18:12:22] [INFO ] Computed 30 invariants in 4 ms
[2024-05-31 18:12:22] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-31 18:12:22] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 18:12:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-31 18:12:22] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 18:12:22] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 18:12:22] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1035 ms.
[2024-05-31 18:12:22] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 18:12:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1835 places, 3469 transitions and 13436 arcs took 17 ms.
[2024-05-31 18:12:23] [INFO ] Flatten gal took : 279 ms
Total runtime 350151 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 : CANConstruction-PT-040-ReachabilityFireability-2024-04
Could not compute solution for formula : CANConstruction-PT-040-ReachabilityFireability-2024-05
Could not compute solution for formula : CANConstruction-PT-040-ReachabilityFireability-2024-09
Could not compute solution for formula : CANConstruction-PT-040-ReachabilityFireability-2024-14

BK_STOP 1717179143714

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANConstruction-PT-040-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/1417/inv_0_
rfs formula name CANConstruction-PT-040-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/1417/inv_1_
rfs formula name CANConstruction-PT-040-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/1417/inv_2_
rfs formula name CANConstruction-PT-040-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1417/inv_3_
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="CANConstruction-PT-040"
export BK_EXAMINATION="ReachabilityFireability"
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 CANConstruction-PT-040, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505000039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;