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-171620398200447.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-q8m256, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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-q8m256-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2023-05
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2023-10
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-12
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-13
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-14
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716301960240

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:32:42] [INFO ] Load time of PNML (sax parser for PT used): 756 ms
[2024-05-21 14:32:42] [INFO ] Transformed 754 places.
[2024-05-21 14:32:42] [INFO ] Transformed 27370 transitions.
[2024-05-21 14:32:42] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1002 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 82 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (13 resets) in 1587 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 394 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 113158 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 4
Probabilistic random walk after 113158 steps, saw 54405 distinct states, run finished after 3013 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-21 14:32:46] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 14:32:46] [INFO ] Computed 10 invariants in 32 ms
[2024-05-21 14:32:46] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 14:32:47] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 10 ms to minimize.
[2024-05-21 14:32:47] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2024-05-21 14:32:48] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2024-05-21 14:32:48] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2024-05-21 14:32:48] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
Problem BugTracking-PT-q8m256-ReachabilityFireability-2023-05 is UNSAT
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m256-ReachabilityFireability-2023-15 is UNSAT
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3005/3129 variables, 124/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3129 variables, 222/357 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3129 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 801/3930 variables, 112/469 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3930 variables, 67/536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3930 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/3937 variables, 2/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3937 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 72/4009 variables, 44/582 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4009 variables, 2/584 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4009 variables, 14/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4009 variables, 0/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4009 variables, 0/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 598 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2495 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/122 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:32:49] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3002/3124 variables, 122/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 222/356 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:32:50] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 2 ms to minimize.
[2024-05-21 14:32:50] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 2/358 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3124 variables, 0/358 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 806/3930 variables, 114/472 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3930 variables, 67/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3930 variables, 0/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/3937 variables, 2/541 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:32:51] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3937 variables, 1/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3937 variables, 0/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 72/4009 variables, 44/586 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4009 variables, 2/588 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4009 variables, 14/602 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:32:52] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 1 ms to minimize.
[2024-05-21 14:32:52] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 5 ms to minimize.
[2024-05-21 14:32:53] [INFO ] Deduced a trap composed of 49 places in 328 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4009 variables, 3/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4009 variables, 0/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/4009 variables, 0/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4009/4009 variables, and 605 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 7072ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 523 ms.
Support contains 13 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 270 transition count 3872
Applied a total of 17 rules in 408 ms. Remains 270 /280 variables (removed 10) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 270/280 places, 3872/3904 transitions.
RANDOM walk for 40081 steps (16 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 98027 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 2
Probabilistic random walk after 98027 steps, saw 65208 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-21 14:32:57] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-21 14:32:57] [INFO ] Computed 8 invariants in 17 ms
[2024-05-21 14:32:58] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:32:58] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2024-05-21 14:32:58] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2940/3048 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3048 variables, 170/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3048 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 849/3897 variables, 111/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3897 variables, 106/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3897 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/3900 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3900 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3900 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 70/3970 variables, 50/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3970 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3970 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 563 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:32:59] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2940/3048 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3048 variables, 170/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:33:00] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 1 ms to minimize.
[2024-05-21 14:33:00] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3048 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3048 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 849/3897 variables, 111/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3897 variables, 106/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:33:01] [INFO ] Deduced a trap composed of 69 places in 266 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3897 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3897 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3900 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3900 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3900 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 70/3970 variables, 50/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3970 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3970 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:33:02] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 1 ms to minimize.
[2024-05-21 14:33:02] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3970 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 569 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 8/8 constraints]
After SMT, in 4690ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 197 ms.
Support contains 13 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 70 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 59 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-21 14:33:02] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 14:33:03] [INFO ] Invariant cache hit.
[2024-05-21 14:33:03] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-21 14:33:03] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 14:33:03] [INFO ] Invariant cache hit.
[2024-05-21 14:33:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 14:33:05] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2726 ms to find 0 implicit places.
[2024-05-21 14:33:06] [INFO ] Redundant transitions in 283 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 14:33:06] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 14:33:06] [INFO ] Invariant cache hit.
[2024-05-21 14:33:06] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3970 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-05-21 14:34:43] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-05-21 14:34:43] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
[2024-05-21 14:34:44] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
[2024-05-21 14:34:44] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
[2024-05-21 14:34:44] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
Problem TDEAD2690 is UNSAT
Problem TDEAD2691 is UNSAT
[2024-05-21 14:34:44] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-05-21 14:34:44] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2717 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 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
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
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 TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2769 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2774 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2776 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2779 is UNSAT
Problem TDEAD2780 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2791 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2807 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2809 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3017 is UNSAT
Problem TDEAD3018 is UNSAT
Problem TDEAD3019 is UNSAT
Problem TDEAD3020 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3025 is UNSAT
Problem TDEAD3026 is UNSAT
Problem TDEAD3027 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3029 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3041 is UNSAT
Problem TDEAD3042 is UNSAT
Problem TDEAD3043 is UNSAT
Problem TDEAD3044 is UNSAT
Problem TDEAD3045 is UNSAT
Problem TDEAD3046 is UNSAT
Problem TDEAD3047 is UNSAT
Problem TDEAD3048 is UNSAT
Problem TDEAD3049 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3053 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3059 is UNSAT
Problem TDEAD3060 is UNSAT
Problem TDEAD3061 is UNSAT
Problem TDEAD3062 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3074 is UNSAT
Problem TDEAD3075 is UNSAT
Problem TDEAD3076 is UNSAT
Problem TDEAD3077 is UNSAT
Problem TDEAD3078 is UNSAT
Problem TDEAD3079 is UNSAT
Problem TDEAD3080 is UNSAT
Problem TDEAD3081 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3086 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3091 is UNSAT
Problem TDEAD3092 is UNSAT
Problem TDEAD3093 is UNSAT
Problem TDEAD3094 is UNSAT
Problem TDEAD3095 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3107 is UNSAT
Problem TDEAD3108 is UNSAT
Problem TDEAD3109 is UNSAT
Problem TDEAD3110 is UNSAT
Problem TDEAD3111 is UNSAT
Problem TDEAD3112 is UNSAT
Problem TDEAD3113 is UNSAT
Problem TDEAD3114 is UNSAT
Problem TDEAD3115 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3119 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3125 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3127 is UNSAT
Problem TDEAD3128 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Problem TDEAD3140 is UNSAT
Problem TDEAD3141 is UNSAT
Problem TDEAD3142 is UNSAT
Problem TDEAD3143 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3145 is UNSAT
Problem TDEAD3146 is UNSAT
Problem TDEAD3147 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3149 is UNSAT
Problem TDEAD3150 is UNSAT
Problem TDEAD3151 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3153 is UNSAT
Problem TDEAD3154 is UNSAT
Problem TDEAD3155 is UNSAT
Problem TDEAD3156 is UNSAT
Problem TDEAD3157 is UNSAT
Problem TDEAD3158 is UNSAT
Problem TDEAD3159 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3161 is UNSAT
Problem TDEAD3162 is UNSAT
Problem TDEAD3163 is UNSAT
Problem TDEAD3164 is UNSAT
Problem TDEAD3165 is UNSAT
Problem TDEAD3166 is UNSAT
Problem TDEAD3167 is UNSAT
Problem TDEAD3168 is UNSAT
Problem TDEAD3169 is UNSAT
Problem TDEAD3170 is UNSAT
Problem TDEAD3171 is UNSAT
Problem TDEAD3172 is UNSAT
Problem TDEAD3173 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3175 is UNSAT
Problem TDEAD3176 is UNSAT
Problem TDEAD3177 is UNSAT
Problem TDEAD3178 is UNSAT
Problem TDEAD3179 is UNSAT
Problem TDEAD3180 is UNSAT
Problem TDEAD3181 is UNSAT
Problem TDEAD3182 is UNSAT
Problem TDEAD3183 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3185 is UNSAT
Problem TDEAD3186 is UNSAT
Problem TDEAD3187 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3189 is UNSAT
Problem TDEAD3190 is UNSAT
Problem TDEAD3191 is UNSAT
Problem TDEAD3192 is UNSAT
Problem TDEAD3193 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3195 is UNSAT
Problem TDEAD3196 is UNSAT
Problem TDEAD3197 is UNSAT
Problem TDEAD3198 is UNSAT
Problem TDEAD3199 is UNSAT
Problem TDEAD3200 is UNSAT
Problem TDEAD3201 is UNSAT
Problem TDEAD3202 is UNSAT
Problem TDEAD3203 is UNSAT
Problem TDEAD3204 is UNSAT
Problem TDEAD3205 is UNSAT
Problem TDEAD3206 is UNSAT
Problem TDEAD3207 is UNSAT
Problem TDEAD3208 is UNSAT
Problem TDEAD3209 is UNSAT
Problem TDEAD3210 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3212 is UNSAT
Problem TDEAD3213 is UNSAT
Problem TDEAD3214 is UNSAT
Problem TDEAD3215 is UNSAT
Problem TDEAD3216 is UNSAT
Problem TDEAD3217 is UNSAT
Problem TDEAD3218 is UNSAT
Problem TDEAD3219 is UNSAT
Problem TDEAD3220 is UNSAT
Problem TDEAD3221 is UNSAT
Problem TDEAD3222 is UNSAT
Problem TDEAD3223 is UNSAT
Problem TDEAD3224 is UNSAT
Problem TDEAD3225 is UNSAT
Problem TDEAD3226 is UNSAT
Problem TDEAD3227 is UNSAT
Problem TDEAD3228 is UNSAT
Problem TDEAD3229 is UNSAT
Problem TDEAD3230 is UNSAT
Problem TDEAD3231 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3233 is UNSAT
Problem TDEAD3234 is UNSAT
Problem TDEAD3235 is UNSAT
Problem TDEAD3236 is UNSAT
Problem TDEAD3237 is UNSAT
Problem TDEAD3238 is UNSAT
Problem TDEAD3239 is UNSAT
Problem TDEAD3240 is UNSAT
Problem TDEAD3241 is UNSAT
Problem TDEAD3242 is UNSAT
Problem TDEAD3243 is UNSAT
Problem TDEAD3244 is UNSAT
Problem TDEAD3245 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3247 is UNSAT
Problem TDEAD3248 is UNSAT
Problem TDEAD3249 is UNSAT
Problem TDEAD3250 is UNSAT
Problem TDEAD3251 is UNSAT
Problem TDEAD3252 is UNSAT
Problem TDEAD3253 is UNSAT
Problem TDEAD3254 is UNSAT
Problem TDEAD3255 is UNSAT
Problem TDEAD3256 is UNSAT
Problem TDEAD3257 is UNSAT
Problem TDEAD3258 is UNSAT
Problem TDEAD3259 is UNSAT
Problem TDEAD3260 is UNSAT
Problem TDEAD3261 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3263 is UNSAT
Problem TDEAD3264 is UNSAT
Problem TDEAD3265 is UNSAT
Problem TDEAD3266 is UNSAT
Problem TDEAD3267 is UNSAT
Problem TDEAD3268 is UNSAT
Problem TDEAD3269 is UNSAT
Problem TDEAD3270 is UNSAT
Problem TDEAD3271 is UNSAT
Problem TDEAD3272 is UNSAT
Problem TDEAD3273 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3275 is UNSAT
Problem TDEAD3276 is UNSAT
Problem TDEAD3277 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3279 is UNSAT
Problem TDEAD3280 is UNSAT
Problem TDEAD3281 is UNSAT
Problem TDEAD3534 is UNSAT
Problem TDEAD3535 is UNSAT
Problem TDEAD3536 is UNSAT
Problem TDEAD3537 is UNSAT
Problem TDEAD3538 is UNSAT
Problem TDEAD3539 is UNSAT
Problem TDEAD3540 is UNSAT
Problem TDEAD3541 is UNSAT
Problem TDEAD3542 is UNSAT
Problem TDEAD3543 is UNSAT
Problem TDEAD3544 is UNSAT
Problem TDEAD3545 is UNSAT
Problem TDEAD3546 is UNSAT
Problem TDEAD3547 is UNSAT
Problem TDEAD3548 is UNSAT
Problem TDEAD3549 is UNSAT
Problem TDEAD3550 is UNSAT
Problem TDEAD3551 is UNSAT
Problem TDEAD3552 is UNSAT
Problem TDEAD3553 is UNSAT
Problem TDEAD3554 is UNSAT
Problem TDEAD3555 is UNSAT
Problem TDEAD3556 is UNSAT
Problem TDEAD3557 is UNSAT
Problem TDEAD3558 is UNSAT
Problem TDEAD3559 is UNSAT
Problem TDEAD3560 is UNSAT
Problem TDEAD3561 is UNSAT
Problem TDEAD3562 is UNSAT
Problem TDEAD3563 is UNSAT
Problem TDEAD3564 is UNSAT
Problem TDEAD3565 is UNSAT
Problem TDEAD3566 is UNSAT
Problem TDEAD3567 is UNSAT
Problem TDEAD3568 is UNSAT
Problem TDEAD3569 is UNSAT
Problem TDEAD3570 is UNSAT
Problem TDEAD3571 is UNSAT
Problem TDEAD3572 is UNSAT
Problem TDEAD3573 is UNSAT
Problem TDEAD3574 is UNSAT
Problem TDEAD3575 is UNSAT
Problem TDEAD3576 is UNSAT
Problem TDEAD3577 is UNSAT
Problem TDEAD3578 is UNSAT
Problem TDEAD3579 is UNSAT
Problem TDEAD3580 is UNSAT
Problem TDEAD3581 is UNSAT
Problem TDEAD3582 is UNSAT
Problem TDEAD3583 is UNSAT
Problem TDEAD3584 is UNSAT
Problem TDEAD3585 is UNSAT
Problem TDEAD3586 is UNSAT
Problem TDEAD3587 is UNSAT
Problem TDEAD3588 is UNSAT
Problem TDEAD3589 is UNSAT
Problem TDEAD3590 is UNSAT
Problem TDEAD3591 is UNSAT
Problem TDEAD3592 is UNSAT
Problem TDEAD3593 is UNSAT
Problem TDEAD3594 is UNSAT
Problem TDEAD3595 is UNSAT
Problem TDEAD3596 is UNSAT
Problem TDEAD3597 is UNSAT
Problem TDEAD3598 is UNSAT
Problem TDEAD3599 is UNSAT
Problem TDEAD3600 is UNSAT
Problem TDEAD3601 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3603 is UNSAT
Problem TDEAD3604 is UNSAT
Problem TDEAD3605 is UNSAT
Problem TDEAD3606 is UNSAT
Problem TDEAD3607 is UNSAT
Problem TDEAD3608 is UNSAT
Problem TDEAD3609 is UNSAT
Problem TDEAD3610 is UNSAT
Problem TDEAD3611 is UNSAT
Problem TDEAD3612 is UNSAT
Problem TDEAD3613 is UNSAT
Problem TDEAD3614 is UNSAT
Problem TDEAD3615 is UNSAT
Problem TDEAD3616 is UNSAT
Problem TDEAD3617 is UNSAT
[2024-05-21 14:34:49] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
Problem TDEAD3621 is UNSAT
Problem TDEAD3622 is UNSAT
Problem TDEAD3623 is UNSAT
Problem TDEAD3624 is UNSAT
Problem TDEAD3625 is UNSAT
Problem TDEAD3626 is UNSAT
Problem TDEAD3627 is UNSAT
Problem TDEAD3628 is UNSAT
Problem TDEAD3629 is UNSAT
Problem TDEAD3630 is UNSAT
Problem TDEAD3631 is UNSAT
Problem TDEAD3632 is UNSAT
Problem TDEAD3633 is UNSAT
Problem TDEAD3634 is UNSAT
Problem TDEAD3635 is UNSAT
Problem TDEAD3636 is UNSAT
Problem TDEAD3637 is UNSAT
Problem TDEAD3638 is UNSAT
Problem TDEAD3639 is UNSAT
Problem TDEAD3640 is UNSAT
Problem TDEAD3641 is UNSAT
Problem TDEAD3642 is UNSAT
[2024-05-21 14:34:49] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
Problem TDEAD3643 is UNSAT
Problem TDEAD3644 is UNSAT
Problem TDEAD3645 is UNSAT
Problem TDEAD3646 is UNSAT
Problem TDEAD3651 is UNSAT
Problem TDEAD3652 is UNSAT
Problem TDEAD3653 is UNSAT
[2024-05-21 14:34:49] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 1 ms to minimize.
SMT process timed out in 103792ms, After SMT, problems are : Problem set: 0 solved, 3870 unsolved
Search for dead transitions found 0 dead transitions in 103840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106939 ms. Remains : 270/270 places, 3872/3872 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 268 transition count 3697
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 181 place count 268 transition count 3693
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 184 place count 265 transition count 3693
Applied a total of 184 rules in 267 ms. Remains 265 /270 variables (removed 5) and now considering 3693/3872 (removed 179) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3693 rows 265 cols
[2024-05-21 14:34:50] [INFO ] Computed 9 invariants in 27 ms
[2024-05-21 14:34:50] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-21 14:34:50] [INFO ] After 499ms SMT Verify possible using After timeout in real domain returned unsat :0 sat :1 real:1
[2024-05-21 14:34:50] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-05-21 14:34:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-21 14:34:51] [INFO ] After 549ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-21 14:34:51] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1663 ms.
[2024-05-21 14:34:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-21 14:34:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 3872 transitions and 19047 arcs took 39 ms.
[2024-05-21 14:34:52] [INFO ] Flatten gal took : 416 ms
Total runtime 130752 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m256

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 270
TRANSITIONS: 3872
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.081s, Sys 0.016s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 693
MODEL NAME: /home/mcc/execution/415/model
270 places, 3872 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.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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-q8m256"
export BK_EXAMINATION="ReachabilityFireability"
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-q8m256, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398200447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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