About the Execution of GreatSPN+red for BugTracking-PT-q8m064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15848.539 | 3221428.00 | 6875566.00 | 421.80 | ?????TTFFTF??FF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398200426.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q8m064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m064-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716300089912
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:01:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:01:32] [INFO ] Load time of PNML (sax parser for PT used): 957 ms
[2024-05-21 14:01:32] [INFO ] Transformed 754 places.
[2024-05-21 14:01:32] [INFO ] Transformed 27370 transitions.
[2024-05-21 14:01:32] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1260 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Deduced a syphon composed of 474 places in 99 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 115 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 14:01:33] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 14:01:33] [INFO ] Computed 8 invariants in 110 ms
[2024-05-21 14:01:34] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2024-05-21 14:01:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 14:01:34] [INFO ] Invariant cache hit.
[2024-05-21 14:01:35] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 14:01:36] [INFO ] Implicit Places using invariants and state equation in 2448 ms returned []
Implicit Place search using SMT with State Equation took 3496 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 14:01:36] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 14:01:36] [INFO ] Invariant cache hit.
[2024-05-21 14:01:37] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 14:02:37] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 20 ms to minimize.
[2024-05-21 14:02:37] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-21 14:02:37] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-21 14:02:45] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
[2024-05-21 14:03:16] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-05-21 14:03:16] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-05-21 14:03:16] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-05-21 14:03:17] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2778 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 timeout
1)
(s243 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 16 constraints, problems are : Problem set: 68 solved, 3801 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 8/8 constraints]
After SMT, in 102933ms problems are : Problem set: 68 solved, 3801 unsolved
Search for dead transitions found 68 dead transitions in 103079ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3803/3904 transitions.
Reduce places removed 17 places and 565 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 260 transition count 3238
Reduce places removed 10 places and 278 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 250 transition count 2960
Reduce places removed 12 places and 336 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 39 place count 238 transition count 2624
Reduce places removed 7 places and 184 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 46 place count 231 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 230 transition count 2420
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 230 transition count 2420
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 48 rules in 41 ms. Remains 230 /277 variables (removed 47) and now considering 2420/3803 (removed 1383) transitions.
[2024-05-21 14:03:19] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 230 cols
[2024-05-21 14:03:19] [INFO ] Computed 10 invariants in 14 ms
[2024-05-21 14:03:20] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-21 14:03:20] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 14:03:20] [INFO ] Invariant cache hit.
[2024-05-21 14:03:20] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 14:03:21] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 230/280 places, 2420/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108637 ms. Remains : 230/280 places, 2420/3904 transitions.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Support contains 15 out of 228 places after structural reductions.
[2024-05-21 14:03:22] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 14:03:22] [INFO ] Flatten gal took : 263 ms
FORMULA BugTracking-PT-q8m064-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:03:22] [INFO ] Flatten gal took : 185 ms
[2024-05-21 14:03:22] [INFO ] Input system was already deterministic with 2420 transitions.
Support contains 10 out of 228 places (down from 15) after GAL structural reductions.
RANDOM walk for 40001 steps (25 resets) in 1880 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 136850 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 4
Probabilistic random walk after 136850 steps, saw 68452 distinct states, run finished after 3005 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-21 14:03:26] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-05-21 14:03:26] [INFO ] Computed 8 invariants in 24 ms
[2024-05-21 14:03:26] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 86/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 14:03:26] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1734/1830 variables, 96/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1830 variables, 102/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1830 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 491/2321 variables, 80/284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2321 variables, 71/355 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2321 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 185/2506 variables, 25/380 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2506 variables, 1/381 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2506 variables, 28/409 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2506 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/2508 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2508 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 38/2546 variables, 27/437 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2546 variables, 1/438 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2546 variables, 9/447 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2546 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/2546 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2546/2546 variables, and 447 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/61 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1170 variables, 61/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1170 variables, 45/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1170 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 188/1358 variables, 46/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1358 variables, 61/216 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1358 variables, 3/219 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:03:28] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1358 variables, 1/220 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1358 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 713/2071 variables, 50/270 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2071 variables, 1/271 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2071 variables, 67/338 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2071 variables, 0/338 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/2078 variables, 2/340 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2078 variables, 1/341 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2078 variables, 0/341 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 422/2500 variables, 46/387 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2500 variables, 1/388 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2500 variables, 32/420 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:03:29] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2500 variables, 1/421 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2500 variables, 0/421 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 45/2545 variables, 24/445 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2545 variables, 1/446 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2545 variables, 5/451 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2545 variables, 0/451 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/2546 variables, 1/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2546 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/2546 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2546/2546 variables, and 452 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 3441ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 583 ms.
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 2421
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 227 transition count 2414
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 220 transition count 2414
Applied a total of 16 rules in 153 ms. Remains 220 /228 variables (removed 8) and now considering 2414/2420 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 220/228 places, 2414/2420 transitions.
RANDOM walk for 40042 steps (8 resets) in 90 ms. (440 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 170735 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 170735 steps, saw 77579 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-21 14:03:33] [INFO ] Flow matrix only has 2310 transitions (discarded 104 similar events)
// Phase 1: matrix 2310 rows 220 cols
[2024-05-21 14:03:33] [INFO ] Computed 8 invariants in 15 ms
[2024-05-21 14:03:33] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1089/1147 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1147 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 205/1352 variables, 46/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1352 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 722/2074 variables, 50/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2074 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2074 variables, 75/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2074 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/2078 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2078 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2078 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 410/2488 variables, 41/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2488 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2488 variables, 25/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2488 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/2530 variables, 23/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2530 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2530 variables, 5/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2530/2530 variables, and 439 constraints, problems are : Problem set: 0 solved, 2 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1089/1147 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1147 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:03:35] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:03:35] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1147 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1147 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 205/1352 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1352 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1352 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:03:35] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 1 ms to minimize.
[2024-05-21 14:03:35] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1352 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1352 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 722/2074 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2074 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2074 variables, 75/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2074 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/2078 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2078 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2078 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 410/2488 variables, 41/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2488 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2488 variables, 25/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:03:37] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2488 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2488 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 42/2530 variables, 23/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2530 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2530 variables, 5/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2530 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/2530 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2530/2530 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 4082ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1422 ms.
Support contains 5 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2414/2414 transitions.
Applied a total of 0 rules in 45 ms. Remains 220 /220 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 220/220 places, 2414/2414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2414/2414 transitions.
Applied a total of 0 rules in 39 ms. Remains 220 /220 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
[2024-05-21 14:03:39] [INFO ] Flow matrix only has 2310 transitions (discarded 104 similar events)
[2024-05-21 14:03:39] [INFO ] Invariant cache hit.
[2024-05-21 14:03:39] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 14:03:39] [INFO ] Flow matrix only has 2310 transitions (discarded 104 similar events)
[2024-05-21 14:03:39] [INFO ] Invariant cache hit.
[2024-05-21 14:03:40] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 14:03:40] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2024-05-21 14:03:41] [INFO ] Redundant transitions in 229 ms returned []
Running 2413 sub problems to find dead transitions.
[2024-05-21 14:03:41] [INFO ] Flow matrix only has 2310 transitions (discarded 104 similar events)
[2024-05-21 14:03:41] [INFO ] Invariant cache hit.
[2024-05-21 14:03:41] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2413 unsolved
[2024-05-21 14:04:17] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
[2024-05-21 14:04:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
[2024-05-21 14:04:19] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 7 ms to minimize.
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
[2024-05-21 14:04:19] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
Problem TDEAD1878 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
[2024-05-21 14:04:22] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2392 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 5/13 constraints. Problems are: Problem set: 628 solved, 1785 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/13 constraints. Problems are: Problem set: 628 solved, 1785 unsolved
At refinement iteration 3 (OVERLAPS) 2310/2530 variables, 220/233 constraints. Problems are: Problem set: 628 solved, 1785 unsolved
SMT process timed out in 53035ms, After SMT, problems are : Problem set: 628 solved, 1785 unsolved
Search for dead transitions found 628 dead transitions in 53074ms
Found 628 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 628 transitions
Dead transitions reduction (with SMT) removed 628 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/220 places, 1786/2414 transitions.
Graph (complete) has 2333 edges and 220 vertex of which 209 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 365 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 194 transition count 1421
Reduce places removed 13 places and 203 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 181 transition count 1218
Reduce places removed 9 places and 105 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 172 transition count 1113
Reduce places removed 6 places and 33 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 44 place count 166 transition count 1080
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 164 transition count 1034
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 163 transition count 1018
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 48 place count 162 transition count 1011
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 69 place count 141 transition count 848
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 92 place count 139 transition count 816
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 102 place count 129 transition count 756
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 112 place count 129 transition count 756
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 112 rules in 75 ms. Remains 129 /220 variables (removed 91) and now considering 756/1786 (removed 1030) transitions.
[2024-05-21 14:04:34] [INFO ] Flow matrix only has 667 transitions (discarded 89 similar events)
// Phase 1: matrix 667 rows 129 cols
[2024-05-21 14:04:34] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 14:04:34] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 14:04:34] [INFO ] Flow matrix only has 667 transitions (discarded 89 similar events)
[2024-05-21 14:04:34] [INFO ] Invariant cache hit.
[2024-05-21 14:04:34] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-21 14:04:34] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/220 places, 756/2414 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55416 ms. Remains : 129/220 places, 756/2414 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40179 steps (8 resets) in 58 ms. (681 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 649257 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 1
Probabilistic random walk after 649257 steps, saw 393875 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2024-05-21 14:04:37] [INFO ] Flow matrix only has 667 transitions (discarded 89 similar events)
// Phase 1: matrix 667 rows 128 cols
[2024-05-21 14:04:37] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 14:04:37] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 241/262 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 56/318 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 246/564 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/571 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 197/768 variables, 56/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/768 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/768 variables, 25/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 27/795 variables, 15/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/795 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/795 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/795 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/795 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 93/93 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 241/262 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 56/318 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 246/564 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/571 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 197/768 variables, 56/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/768 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 25/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 14:04:38] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-05-21 14:04:38] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/768 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/768 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/795 variables, 15/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/795 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/795 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/795 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/795 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 756/756 transitions.
Applied a total of 0 rules in 18 ms. Remains 128 /128 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 128/128 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 756/756 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2024-05-21 14:04:38] [INFO ] Flow matrix only has 667 transitions (discarded 89 similar events)
[2024-05-21 14:04:38] [INFO ] Invariant cache hit.
[2024-05-21 14:04:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 14:04:38] [INFO ] Flow matrix only has 667 transitions (discarded 89 similar events)
[2024-05-21 14:04:38] [INFO ] Invariant cache hit.
[2024-05-21 14:04:38] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-21 14:04:39] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-21 14:04:39] [INFO ] Redundant transitions in 16 ms returned []
Running 755 sub problems to find dead transitions.
[2024-05-21 14:04:39] [INFO ] Flow matrix only has 667 transitions (discarded 89 similar events)
[2024-05-21 14:04:39] [INFO ] Invariant cache hit.
[2024-05-21 14:04:39] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 755 unsolved
[2024-05-21 14:04:43] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
Problem TDEAD749 is UNSAT
Problem TDEAD755 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 3 (OVERLAPS) 667/795 variables, 128/136 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/795 variables, 93/229 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 0/229 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 6 (OVERLAPS) 0/795 variables, 0/229 constraints. Problems are: Problem set: 2 solved, 753 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 229 constraints, problems are : Problem set: 2 solved, 753 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 753 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 3 (OVERLAPS) 667/795 variables, 128/136 constraints. Problems are: Problem set: 2 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/795 variables, 93/229 constraints. Problems are: Problem set: 2 solved, 753 unsolved
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 753/982 constraints. Problems are: Problem set: 92 solved, 663 unsolved
[2024-05-21 14:05:24] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-21 14:05:24] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-21 14:05:25] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
[2024-05-21 14:05:29] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 4/986 constraints. Problems are: Problem set: 160 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 795/795 variables, and 986 constraints, problems are : Problem set: 160 solved, 595 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 753/755 constraints, Known Traps: 5/5 constraints]
After SMT, in 62083ms problems are : Problem set: 160 solved, 595 unsolved
Search for dead transitions found 160 dead transitions in 62096ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 128/128 places, 596/756 transitions.
Graph (complete) has 881 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 128 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 113 transition count 468
Reduce places removed 4 places and 39 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 109 transition count 429
Reduce places removed 3 places and 26 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 106 transition count 403
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 104 transition count 387
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 103 transition count 382
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 28 place count 98 transition count 330
Iterating global reduction 5 with 5 rules applied. Total rules applied 33 place count 98 transition count 330
Applied a total of 33 rules in 28 ms. Remains 98 /128 variables (removed 30) and now considering 330/596 (removed 266) transitions.
[2024-05-21 14:05:41] [INFO ] Flow matrix only has 310 transitions (discarded 20 similar events)
// Phase 1: matrix 310 rows 98 cols
[2024-05-21 14:05:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 14:05:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 14:05:41] [INFO ] Flow matrix only has 310 transitions (discarded 20 similar events)
[2024-05-21 14:05:41] [INFO ] Invariant cache hit.
[2024-05-21 14:05:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 14:05:41] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/128 places, 330/756 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63093 ms. Remains : 98/128 places, 330/756 transitions.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q8m064-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:05:41] [INFO ] Flatten gal took : 154 ms
[2024-05-21 14:05:42] [INFO ] Flatten gal took : 161 ms
[2024-05-21 14:05:42] [INFO ] Input system was already deterministic with 2420 transitions.
Computed a total of 4 stabilizing places and 73 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 85 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:42] [INFO ] Flatten gal took : 110 ms
[2024-05-21 14:05:42] [INFO ] Flatten gal took : 122 ms
[2024-05-21 14:05:42] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:43] [INFO ] Flatten gal took : 125 ms
[2024-05-21 14:05:43] [INFO ] Flatten gal took : 121 ms
[2024-05-21 14:05:43] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:43] [INFO ] Flatten gal took : 98 ms
[2024-05-21 14:05:43] [INFO ] Flatten gal took : 106 ms
[2024-05-21 14:05:43] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:44] [INFO ] Flatten gal took : 92 ms
[2024-05-21 14:05:44] [INFO ] Flatten gal took : 102 ms
[2024-05-21 14:05:44] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:44] [INFO ] Flatten gal took : 90 ms
[2024-05-21 14:05:44] [INFO ] Flatten gal took : 100 ms
[2024-05-21 14:05:44] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:44] [INFO ] Flatten gal took : 94 ms
[2024-05-21 14:05:44] [INFO ] Flatten gal took : 103 ms
[2024-05-21 14:05:45] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:45] [INFO ] Flatten gal took : 89 ms
[2024-05-21 14:05:45] [INFO ] Flatten gal took : 97 ms
[2024-05-21 14:05:45] [INFO ] Input system was already deterministic with 2420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 228/228 places, 2420/2420 transitions.
[2024-05-21 14:05:45] [INFO ] Flatten gal took : 89 ms
[2024-05-21 14:05:45] [INFO ] Flatten gal took : 100 ms
[2024-05-21 14:05:46] [INFO ] Input system was already deterministic with 2420 transitions.
[2024-05-21 14:05:46] [INFO ] Flatten gal took : 92 ms
[2024-05-21 14:05:46] [INFO ] Flatten gal took : 102 ms
[2024-05-21 14:05:46] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-21 14:05:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 2420 transitions and 11832 arcs took 16 ms.
Total runtime 254821 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BugTracking-PT-q8m064
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 228
TRANSITIONS: 2420
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.008s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.004s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 750
MODEL NAME: /home/mcc/execution/414/model
228 places, 2420 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716303311340
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="BugTracking-PT-q8m064"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BugTracking-PT-q8m064, 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 r047-tajo-171620398200426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m064.tgz
mv BugTracking-PT-q8m064 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;