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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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-q8m008-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2023-09
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2023-11
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m008-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716297819892

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:23:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:23:42] [INFO ] Load time of PNML (sax parser for PT used): 1259 ms
[2024-05-21 13:23:42] [INFO ] Transformed 754 places.
[2024-05-21 13:23:42] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:23:43] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1615 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 108 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40004 steps (256 resets) in 3320 ms. (12 steps per ms) remains 4/5 properties
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (49 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (54 resets) in 428 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (46 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
[2024-05-21 13:23:45] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 13:23:45] [INFO ] Computed 10 invariants in 56 ms
[2024-05-21 13:23:45] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3552/3706 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3706 variables, 140/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3706 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 301/4007 variables, 124/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4007 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4007 variables, 163/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4007 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/4009 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2569 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3552/3706 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3706 variables, 140/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3706 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 301/4007 variables, 124/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4007 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4007 variables, 163/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4007 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 13:23:51] [INFO ] Deduced a trap composed of 16 places in 1072 ms of which 37 ms to minimize.
[2024-05-21 13:23:52] [INFO ] Deduced a trap composed of 68 places in 921 ms of which 2 ms to minimize.
[2024-05-21 13:23:52] [INFO ] Deduced a trap composed of 22 places in 452 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4007/4009 variables, and 595 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 278/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 7945ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 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.29 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 614 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 636 ms. Remains : 270/280 places, 3872/3904 transitions.
RANDOM walk for 40003 steps (9 resets) in 559 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 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 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 80371 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 80371 steps, saw 55635 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 13:23:57] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-21 13:23:57] [INFO ] Computed 8 invariants in 33 ms
[2024-05-21 13:23:57] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 133/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3528/3679 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 291/3970 variables, 119/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3970 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 163/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 561 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 133/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3528/3679 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 120/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 291/3970 variables, 119/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3970 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 163/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 13:24:01] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 3 ms to minimize.
[2024-05-21 13:24:02] [INFO ] Deduced a trap composed of 28 places in 514 ms of which 2 ms to minimize.
[2024-05-21 13:24:02] [INFO ] Deduced a trap composed of 67 places in 490 ms of which 5 ms to minimize.
[2024-05-21 13:24:03] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 16 ms to minimize.
[2024-05-21 13:24:03] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 2 ms to minimize.
[2024-05-21 13:24:04] [INFO ] Deduced a trap composed of 48 places in 502 ms of which 1 ms to minimize.
[2024-05-21 13:24:04] [INFO ] Deduced a trap composed of 16 places in 407 ms of which 2 ms to minimize.
[2024-05-21 13:24:04] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-21 13:24:05] [INFO ] Deduced a trap composed of 16 places in 357 ms of which 1 ms to minimize.
[2024-05-21 13:24:05] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 1 ms to minimize.
[2024-05-21 13:24:06] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 2 ms to minimize.
[2024-05-21 13:24:06] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 1 ms to minimize.
[2024-05-21 13:24:06] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 1 ms to minimize.
Problem BugTracking-PT-q8m008-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/3970 variables, 13/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3970 variables, 0/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3970 variables, 0/577 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 577 constraints, problems are : Problem set: 1 solved, 3 unsolved in 8593 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 10447ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 852 ms.
Support contains 17 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 88 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 101 ms. Remains : 270/270 places, 3872/3872 transitions.
RANDOM walk for 40014 steps (8 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 71371 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 3
Probabilistic random walk after 71371 steps, saw 49405 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-21 13:24:12] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:24:12] [INFO ] Invariant cache hit.
[2024-05-21 13:24:12] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3527/3677 variables, 150/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3677 variables, 119/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3677 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 293/3970 variables, 120/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3970 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 164/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3527/3677 variables, 150/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3677 variables, 119/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:24:15] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3677 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3677 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/3970 variables, 120/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3970 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3970 variables, 164/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3970 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:24:16] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 1 ms to minimize.
[2024-05-21 13:24:17] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 1 ms to minimize.
[2024-05-21 13:24:17] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2024-05-21 13:24:17] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2024-05-21 13:24:18] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3970 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 569 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4490 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6309ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4492 ms.
Support contains 17 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 148 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 148 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 193 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-21 13:24:23] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:24:23] [INFO ] Invariant cache hit.
[2024-05-21 13:24:24] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-05-21 13:24:24] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:24:24] [INFO ] Invariant cache hit.
[2024-05-21 13:24:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:24:26] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
[2024-05-21 13:24:26] [INFO ] Redundant transitions in 236 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-05-21 13:24:26] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:24:26] [INFO ] Invariant cache hit.
[2024-05-21 13:24:26] [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, 3871 unsolved
[2024-05-21 13:25:36] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3970 variables, and 9 constraints, problems are : Problem set: 8 solved, 3863 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 3863 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 3863 unsolved
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
[2024-05-21 13:26:05] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
[2024-05-21 13:26:06] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2244 is UNSAT
Problem TDEAD2245 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
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
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
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 TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 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 TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 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
Problem TDEAD2690 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-05-21 13:26:10] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 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 TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
[2024-05-21 13:26:10] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
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 TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
[2024-05-21 13:26:11] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
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 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 TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 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
[2024-05-21 13:26:11] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
[2024-05-21 13:26:11] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
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
[2024-05-21 13:26:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Problem TDEAD3816 is UNSAT
[2024-05-21 13:26:16] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 4 ms to minimize.
SMT process timed out in 109916ms, After SMT, problems are : Problem set: 8 solved, 3863 unsolved
Search for dead transitions found 660 dead transitions in 110001ms
Found 660 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 660 transitions
Dead transitions reduction (with SMT) removed 660 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 3212/3872 transitions.
Graph (complete) has 3815 edges and 270 vertex of which 255 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 1205 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 215 transition count 2007
Reduce places removed 24 places and 414 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 65 place count 191 transition count 1593
Reduce places removed 13 places and 241 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 78 place count 178 transition count 1352
Reduce places removed 9 places and 122 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 87 place count 169 transition count 1230
Reduce places removed 4 places and 82 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 91 place count 165 transition count 1148
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 164 transition count 1133
Reduce places removed 0 places and 22 transitions.
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 102 place count 154 transition count 1005
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 114 place count 152 transition count 975
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 114 rules in 67 ms. Remains 152 /270 variables (removed 118) and now considering 975/3212 (removed 2237) transitions.
[2024-05-21 13:26:16] [INFO ] Flow matrix only has 905 transitions (discarded 70 similar events)
// Phase 1: matrix 905 rows 152 cols
[2024-05-21 13:26:16] [INFO ] Computed 16 invariants in 3 ms
[2024-05-21 13:26:17] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 13:26:17] [INFO ] Flow matrix only has 905 transitions (discarded 70 similar events)
[2024-05-21 13:26:17] [INFO ] Invariant cache hit.
[2024-05-21 13:26:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:26:17] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 152/270 places, 975/3872 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 114247 ms. Remains : 152/270 places, 975/3872 transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
FORMULA BugTracking-PT-q8m008-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40017 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168963 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168963 steps, saw 116960 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-21 13:26:20] [INFO ] Flow matrix only has 905 transitions (discarded 70 similar events)
// Phase 1: matrix 905 rows 143 cols
[2024-05-21 13:26:20] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 13:26:20] [INFO ] State equation strengthened by 111 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) 29/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 572/606 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/606 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/606 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 412/1018 variables, 90/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1018 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 75/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/1048 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1048 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1048 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1048 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1048 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 111/111 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) 29/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 572/606 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/606 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/606 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 412/1018 variables, 90/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1018 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 75/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:26:21] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-21 13:26:21] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1018 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1018 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/1048 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1048 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1048 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1048 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 265 constraints, problems are : Problem set: 0 solved, 2 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1388ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 975/975 transitions.
Applied a total of 0 rules in 11 ms. Remains 143 /143 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 143/143 places, 975/975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 975/975 transitions.
Applied a total of 0 rules in 11 ms. Remains 143 /143 variables (removed 0) and now considering 975/975 (removed 0) transitions.
[2024-05-21 13:26:22] [INFO ] Flow matrix only has 905 transitions (discarded 70 similar events)
[2024-05-21 13:26:22] [INFO ] Invariant cache hit.
[2024-05-21 13:26:23] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-21 13:26:23] [INFO ] Flow matrix only has 905 transitions (discarded 70 similar events)
[2024-05-21 13:26:23] [INFO ] Invariant cache hit.
[2024-05-21 13:26:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 13:26:23] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-21 13:26:23] [INFO ] Redundant transitions in 29 ms returned []
Running 974 sub problems to find dead transitions.
[2024-05-21 13:26:23] [INFO ] Flow matrix only has 905 transitions (discarded 70 similar events)
[2024-05-21 13:26:23] [INFO ] Invariant cache hit.
[2024-05-21 13:26:23] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 974 unsolved
[2024-05-21 13:26:28] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-21 13:26:29] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 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 TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
[2024-05-21 13:26:31] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
[2024-05-21 13:26:31] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 4/11 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 905/1048 variables, 143/154 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 111/265 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1048 variables, 0/265 constraints. Problems are: Problem set: 207 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 265 constraints, problems are : Problem set: 207 solved, 767 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 207 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 7/7 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 4/11 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 905/1048 variables, 143/154 constraints. Problems are: Problem set: 207 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 111/265 constraints. Problems are: Problem set: 207 solved, 767 unsolved
Problem TDEAD72 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 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 TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 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 TDEAD710 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD953 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1048 variables, 767/1032 constraints. Problems are: Problem set: 299 solved, 675 unsolved
[2024-05-21 13:27:09] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-21 13:27:09] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-05-21 13:27:10] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 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 TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 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 TDEAD300 is UNSAT
Problem TDEAD340 is UNSAT
[2024-05-21 13:27:16] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 1036 constraints, problems are : Problem set: 351 solved, 623 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 767/974 constraints, Known Traps: 8/8 constraints]
After SMT, in 62934ms problems are : Problem set: 351 solved, 623 unsolved
Search for dead transitions found 351 dead transitions in 62944ms
Found 351 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 351 transitions
Dead transitions reduction (with SMT) removed 351 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 624/975 transitions.
Graph (complete) has 938 edges and 143 vertex of which 140 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 23 places and 219 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 117 transition count 405
Reduce places removed 10 places and 32 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 34 place count 107 transition count 373
Reduce places removed 2 places and 10 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 105 transition count 363
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 104 transition count 358
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 42 place count 99 transition count 323
Iterating global reduction 4 with 5 rules applied. Total rules applied 47 place count 99 transition count 323
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 98 transition count 317
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 98 transition count 317
Applied a total of 49 rules in 19 ms. Remains 98 /143 variables (removed 45) and now considering 317/624 (removed 307) transitions.
[2024-05-21 13:27:26] [INFO ] Flow matrix only has 295 transitions (discarded 22 similar events)
// Phase 1: matrix 295 rows 98 cols
[2024-05-21 13:27:26] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 13:27:26] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 13:27:26] [INFO ] Flow matrix only has 295 transitions (discarded 22 similar events)
[2024-05-21 13:27:26] [INFO ] Invariant cache hit.
[2024-05-21 13:27:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 13:27:27] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/143 places, 317/975 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64800 ms. Remains : 98/143 places, 317/975 transitions.
RANDOM walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 220681 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 220681 steps, saw 152758 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-21 13:27:30] [INFO ] Flow matrix only has 295 transitions (discarded 22 similar events)
[2024-05-21 13:27:30] [INFO ] Invariant cache hit.
[2024-05-21 13:27:30] [INFO ] State equation strengthened by 60 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) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 156/177 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 187/364 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 29/393 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/393 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 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) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 156/177 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 187/364 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 29/393 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 13:27:30] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/393 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/393 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/393 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 781ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 336 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 317/317 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/98 places, 317/317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 317/317 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-05-21 13:27:31] [INFO ] Flow matrix only has 295 transitions (discarded 22 similar events)
[2024-05-21 13:27:31] [INFO ] Invariant cache hit.
[2024-05-21 13:27:31] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-21 13:27:31] [INFO ] Flow matrix only has 295 transitions (discarded 22 similar events)
[2024-05-21 13:27:31] [INFO ] Invariant cache hit.
[2024-05-21 13:27:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 13:27:32] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-21 13:27:32] [INFO ] Redundant transitions in 2 ms returned []
Running 316 sub problems to find dead transitions.
[2024-05-21 13:27:32] [INFO ] Flow matrix only has 295 transitions (discarded 22 similar events)
[2024-05-21 13:27:32] [INFO ] Invariant cache hit.
[2024-05-21 13:27:32] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 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 TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
At refinement iteration 2 (OVERLAPS) 295/393 variables, 98/105 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 60/165 constraints. Problems are: Problem set: 35 solved, 281 unsolved
[2024-05-21 13:27:35] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 1/166 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/166 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/393 variables, 0/166 constraints. Problems are: Problem set: 35 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 166 constraints, problems are : Problem set: 35 solved, 281 unsolved in 7460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 35 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 295/393 variables, 98/106 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 60/166 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 281/447 constraints. Problems are: Problem set: 35 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/447 constraints. Problems are: Problem set: 35 solved, 281 unsolved
[2024-05-21 13:27:46] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/393 variables, 1/448 constraints. Problems are: Problem set: 35 solved, 281 unsolved
[2024-05-21 13:28:02] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 10 ms to minimize.
[2024-05-21 13:28:02] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-21 13:28:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-21 13:28:03] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-21 13:28:03] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 5/453 constraints. Problems are: Problem set: 35 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 453 constraints, problems are : Problem set: 35 solved, 281 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 281/316 constraints, Known Traps: 7/7 constraints]
After SMT, in 37741ms problems are : Problem set: 35 solved, 281 unsolved
Search for dead transitions found 35 dead transitions in 37747ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/98 places, 282/317 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-21 13:28:09] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38466 ms. Remains : 98/98 places, 282/317 transitions.
RANDOM walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 205160 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 205160 steps, saw 142014 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-21 13:28:12] [INFO ] Flow matrix only has 260 transitions (discarded 22 similar events)
// Phase 1: matrix 260 rows 98 cols
[2024-05-21 13:28:12] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 13:28:12] [INFO ] State equation strengthened by 55 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) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 146/167 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 159/326 variables, 54/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/358 variables, 23/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 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) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 159/326 variables, 54/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:28:13] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-21 13:28:13] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 32/358 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:28:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 13:28:13] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/358 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 282/282 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 282/282 transitions.
Applied a total of 0 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-05-21 13:28:13] [INFO ] Flow matrix only has 260 transitions (discarded 22 similar events)
[2024-05-21 13:28:13] [INFO ] Invariant cache hit.
[2024-05-21 13:28:13] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 13:28:13] [INFO ] Flow matrix only has 260 transitions (discarded 22 similar events)
[2024-05-21 13:28:13] [INFO ] Invariant cache hit.
[2024-05-21 13:28:13] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:28:13] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-21 13:28:14] [INFO ] Redundant transitions in 0 ms returned []
Running 281 sub problems to find dead transitions.
[2024-05-21 13:28:14] [INFO ] Flow matrix only has 260 transitions (discarded 22 similar events)
[2024-05-21 13:28:14] [INFO ] Invariant cache hit.
[2024-05-21 13:28:14] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 260/358 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 13:28:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 161 constraints, problems are : Problem set: 0 solved, 281 unsolved in 7548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 260/358 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 55/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 281/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 13:28:24] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-21 13:28:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/444 constraints. Problems are: Problem set: 1 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 444 constraints, problems are : Problem set: 1 solved, 280 unsolved in 16008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints]
After SMT, in 23763ms problems are : Problem set: 1 solved, 280 unsolved
Search for dead transitions found 1 dead transitions in 23770ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/98 places, 281/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-05-21 13:28:37] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24143 ms. Remains : 98/98 places, 281/282 transitions.
RANDOM walk for 40007 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 326328 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 326328 steps, saw 225888 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-21 13:28:40] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-05-21 13:28:40] [INFO ] Invariant cache hit.
[2024-05-21 13:28:40] [INFO ] State equation strengthened by 55 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) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 146/167 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 159/326 variables, 54/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/358 variables, 23/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 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) 16/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 159/326 variables, 54/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 28/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:28:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-21 13:28:41] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-21 13:28:41] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:28:41] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 32/358 variables, 23/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:28:41] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 443 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 281/281 transitions.
Applied a total of 0 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 98/98 places, 281/281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 281/281 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-05-21 13:28:41] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-05-21 13:28:41] [INFO ] Invariant cache hit.
[2024-05-21 13:28:41] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 13:28:42] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-05-21 13:28:42] [INFO ] Invariant cache hit.
[2024-05-21 13:28:42] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 13:28:42] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-21 13:28:42] [INFO ] Redundant transitions in 1 ms returned []
Running 280 sub problems to find dead transitions.
[2024-05-21 13:28:42] [INFO ] Flow matrix only has 260 transitions (discarded 21 similar events)
[2024-05-21 13:28:42] [INFO ] Invariant cache hit.
[2024-05-21 13:28:42] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 260/358 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-21 13:28:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 161 constraints, problems are : Problem set: 0 solved, 280 unsolved in 7271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 260/358 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 55/161 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 280/441 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-21 13:28:52] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 13:28:52] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 443 constraints, problems are : Problem set: 0 solved, 280 unsolved in 10686 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 3/3 constraints]
After SMT, in 18145ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 18148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18429 ms. Remains : 98/98 places, 281/281 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 417 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 94 transition count 259
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 36 place count 81 transition count 197
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 81 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 81 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 80 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 80 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 79 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 79 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 79 transition count 191
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 63 place count 75 transition count 187
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 71 transition count 206
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 71 transition count 201
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 81 place count 66 transition count 201
Applied a total of 81 rules in 38 ms. Remains 66 /98 variables (removed 32) and now considering 201/281 (removed 80) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 201 rows 66 cols
[2024-05-21 13:29:00] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 13:29:00] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-21 13:29:00] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 13:29:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-21 13:29:00] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 13:29:00] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 13:29:00] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 298 ms.
[2024-05-21 13:29:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-21 13:29:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 281 transitions and 1336 arcs took 7 ms.
[2024-05-21 13:29:01] [INFO ] Flatten gal took : 136 ms
Total runtime 319751 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m008

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 98
TRANSITIONS: 281
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
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: 959
MODEL NAME: /home/mcc/execution/417/model
98 places, 281 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716298142391

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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-q8m008"
export BK_EXAMINATION="ReachabilityCardinality"
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-q8m008, examination is ReachabilityCardinality"
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-171620398100406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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