Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399400386.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 itstools
Input is BugTracking-PT-q8m002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399400386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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:23 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-q8m002-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m002-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716332502789

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:01:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:01:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:01:45] [INFO ] Load time of PNML (sax parser for PT used): 864 ms
[2024-05-21 23:01:45] [INFO ] Transformed 754 places.
[2024-05-21 23:01:45] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:01:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Deduced a syphon composed of 474 places in 110 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 88 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 23:01:46] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 23:01:46] [INFO ] Computed 8 invariants in 47 ms
[2024-05-21 23:01:46] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-05-21 23:01:46] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:01:46] [INFO ] Invariant cache hit.
[2024-05-21 23:01:47] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 23:01:49] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 3067 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 23:01:49] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:01:49] [INFO ] Invariant cache hit.
[2024-05-21 23:01:49] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 23:02:46] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 11 ms to minimize.
[2024-05-21 23:02:46] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2024-05-21 23:02:46] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2024-05-21 23:02:53] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
[2024-05-21 23:03:27] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2778 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 16 constraints, problems are : Problem set: 68 solved, 3801 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 8/8 constraints]
After SMT, in 100290ms problems are : Problem set: 68 solved, 3801 unsolved
Search for dead transitions found 68 dead transitions in 100372ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3803/3904 transitions.
Reduce places removed 17 places and 565 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 260 transition count 3238
Reduce places removed 10 places and 278 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 250 transition count 2960
Reduce places removed 11 places and 336 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 38 place count 239 transition count 2624
Reduce places removed 8 places and 184 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 46 place count 231 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 230 transition count 2420
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 230 transition count 2420
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 48 rules in 33 ms. Remains 230 /277 variables (removed 47) and now considering 2420/3803 (removed 1383) transitions.
[2024-05-21 23:03:29] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 230 cols
[2024-05-21 23:03:29] [INFO ] Computed 10 invariants in 9 ms
[2024-05-21 23:03:29] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-21 23:03:29] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 23:03:29] [INFO ] Invariant cache hit.
[2024-05-21 23:03:30] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 23:03:31] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 230/280 places, 2420/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105158 ms. Remains : 230/280 places, 2420/3904 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Support contains 10 out of 228 places after structural reductions.
[2024-05-21 23:03:31] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-21 23:03:31] [INFO ] Flatten gal took : 306 ms
[2024-05-21 23:03:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m002-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:03:31] [INFO ] Flatten gal took : 194 ms
[2024-05-21 23:03:32] [INFO ] Input system was already deterministic with 2420 transitions.
Support contains 5 out of 228 places (down from 10) after GAL structural reductions.
RANDOM walk for 40000 steps (778 resets) in 2339 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (208 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 139731 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 139731 steps, saw 82138 distinct states, run finished after 3008 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-21 23:03:36] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-05-21 23:03:36] [INFO ] Computed 8 invariants in 7 ms
[2024-05-21 23:03:36] [INFO ] State equation strengthened by 210 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) 51/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 985/1041 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1041 variables, 56/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1041 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 745/1786 variables, 60/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1786 variables, 78/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1786 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 714/2500 variables, 70/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2500 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2500 variables, 76/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/2505 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2505 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 41/2546 variables, 42/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2546 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2546 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2546 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2546/2546 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 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) 51/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 985/1041 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1041 variables, 56/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1041 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 745/1786 variables, 60/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1786 variables, 78/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1786 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:03:38] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1786 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1786 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 714/2500 variables, 70/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2500 variables, 76/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2500 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2500 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/2505 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2505 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 41/2546 variables, 42/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2546 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:03:39] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2546 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:03:39] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2546 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2546 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/2546 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2546/2546 variables, and 451 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2810 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4271ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1925 ms.
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 226 transition count 2423
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 226 transition count 2418
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 221 transition count 2418
Applied a total of 14 rules in 161 ms. Remains 221 /228 variables (removed 7) and now considering 2418/2420 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 221/228 places, 2418/2420 transitions.
RANDOM walk for 40000 steps (11 resets) in 518 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 128175 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 128175 steps, saw 58753 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 23:03:45] [INFO ] Flow matrix only has 2311 transitions (discarded 107 similar events)
// Phase 1: matrix 2311 rows 221 cols
[2024-05-21 23:03:45] [INFO ] Computed 8 invariants in 15 ms
[2024-05-21 23:03:45] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 984/1039 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 57/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 743/1782 variables, 59/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 78/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1782 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 713/2495 variables, 70/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2495 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2495 variables, 76/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2495 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/2496 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2496 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2496 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 36/2532 variables, 36/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2532 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2532 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2532 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2532/2532 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/221 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 984/1039 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 57/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:03:47] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1039 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 743/1782 variables, 59/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1782 variables, 78/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1782 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1782 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 713/2495 variables, 70/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2495 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2495 variables, 76/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2495 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:03:48] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2495 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2495 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/2496 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2496 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2496 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 36/2532 variables, 36/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2532 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:03:49] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2532 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2532 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2532 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2532/2532 variables, and 445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/221 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3658ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1113 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 2418/2418 transitions.
Applied a total of 0 rules in 48 ms. Remains 221 /221 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 221/221 places, 2418/2418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 2418/2418 transitions.
Applied a total of 0 rules in 35 ms. Remains 221 /221 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
[2024-05-21 23:03:50] [INFO ] Flow matrix only has 2311 transitions (discarded 107 similar events)
[2024-05-21 23:03:50] [INFO ] Invariant cache hit.
[2024-05-21 23:03:51] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-21 23:03:51] [INFO ] Flow matrix only has 2311 transitions (discarded 107 similar events)
[2024-05-21 23:03:51] [INFO ] Invariant cache hit.
[2024-05-21 23:03:51] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:03:52] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2024-05-21 23:03:53] [INFO ] Redundant transitions in 128 ms returned []
Running 2417 sub problems to find dead transitions.
[2024-05-21 23:03:53] [INFO ] Flow matrix only has 2311 transitions (discarded 107 similar events)
[2024-05-21 23:03:53] [INFO ] Invariant cache hit.
[2024-05-21 23:03:53] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2417 unsolved
[2024-05-21 23:04:30] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
[2024-05-21 23:04:30] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
[2024-05-21 23:04:30] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
Problem TDEAD1923 is UNSAT
[2024-05-21 23:04:30] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
[2024-05-21 23:04:30] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
[2024-05-21 23:04:31] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1955 is UNSAT
[2024-05-21 23:04:31] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
Problem TDEAD1956 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
[2024-05-21 23:04:31] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 8/16 constraints. Problems are: Problem set: 347 solved, 2070 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 347 solved, 2070 unsolved
SMT process timed out in 50519ms, After SMT, problems are : Problem set: 347 solved, 2070 unsolved
Search for dead transitions found 347 dead transitions in 50558ms
Found 347 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 347 transitions
Dead transitions reduction (with SMT) removed 347 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 221/221 places, 2071/2418 transitions.
Graph (complete) has 2594 edges and 221 vertex of which 210 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 473 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 190 transition count 1598
Reduce places removed 16 places and 207 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 37 place count 174 transition count 1391
Reduce places removed 11 places and 159 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 48 place count 163 transition count 1232
Reduce places removed 8 places and 104 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 56 place count 155 transition count 1128
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 153 transition count 1082
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 152 transition count 1067
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 60 place count 151 transition count 1047
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 68 place count 143 transition count 961
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 78 place count 141 transition count 931
Applied a total of 78 rules in 86 ms. Remains 141 /221 variables (removed 80) and now considering 931/2071 (removed 1140) transitions.
[2024-05-21 23:04:43] [INFO ] Flow matrix only has 871 transitions (discarded 60 similar events)
// Phase 1: matrix 871 rows 141 cols
[2024-05-21 23:04:43] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 23:04:43] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 23:04:44] [INFO ] Flow matrix only has 871 transitions (discarded 60 similar events)
[2024-05-21 23:04:44] [INFO ] Invariant cache hit.
[2024-05-21 23:04:44] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-21 23:04:44] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 141/221 places, 931/2418 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53895 ms. Remains : 141/221 places, 931/2418 transitions.
RANDOM walk for 40002 steps (11 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 266326 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 266326 steps, saw 140295 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-21 23:04:47] [INFO ] Flow matrix only has 871 transitions (discarded 60 similar events)
[2024-05-21 23:04:47] [INFO ] Invariant cache hit.
[2024-05-21 23:04:47] [INFO ] State equation strengthened by 113 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) 13/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 193/211 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 294/505 variables, 36/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 43/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 460/965 variables, 56/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/965 variables, 50/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/965 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/967 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/967 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 45/1012 variables, 31/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1012 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1012 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1012 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1012 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 113/113 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) 13/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 193/211 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 294/505 variables, 36/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 43/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 460/965 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/965 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/965 variables, 50/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/965 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:04:48] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:04:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/965 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:04:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/965 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:04:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/965 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/965 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/967 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:04:48] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 12 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/967 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/967 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 45/1012 variables, 31/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1012 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1012 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:04:49] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:04:49] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1012 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:04:49] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1012 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1012 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1012 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 271 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1457 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 1899ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 177 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 931/931 transitions.
Applied a total of 0 rules in 12 ms. Remains 141 /141 variables (removed 0) and now considering 931/931 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 141/141 places, 931/931 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 931/931 transitions.
Applied a total of 0 rules in 9 ms. Remains 141 /141 variables (removed 0) and now considering 931/931 (removed 0) transitions.
[2024-05-21 23:04:49] [INFO ] Flow matrix only has 871 transitions (discarded 60 similar events)
[2024-05-21 23:04:49] [INFO ] Invariant cache hit.
[2024-05-21 23:04:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 23:04:49] [INFO ] Flow matrix only has 871 transitions (discarded 60 similar events)
[2024-05-21 23:04:49] [INFO ] Invariant cache hit.
[2024-05-21 23:04:49] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-21 23:04:50] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-21 23:04:50] [INFO ] Redundant transitions in 12 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-21 23:04:50] [INFO ] Flow matrix only has 871 transitions (discarded 60 similar events)
[2024-05-21 23:04:50] [INFO ] Invariant cache hit.
[2024-05-21 23:04:50] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-21 23:04:55] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:04:55] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 3 (OVERLAPS) 871/1012 variables, 141/150 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 113/263 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 263 constraints, problems are : Problem set: 4 solved, 926 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 3 (OVERLAPS) 871/1012 variables, 141/150 constraints. Problems are: Problem set: 4 solved, 926 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 113/263 constraints. Problems are: Problem set: 4 solved, 926 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 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 TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 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 TDEAD791 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 926/1189 constraints. Problems are: Problem set: 90 solved, 840 unsolved
[2024-05-21 23:05:43] [INFO ] Deduced a trap composed of 15 places in 1465 ms of which 21 ms to minimize.
[2024-05-21 23:05:44] [INFO ] Deduced a trap composed of 7 places in 1031 ms of which 80 ms to minimize.
[2024-05-21 23:05:45] [INFO ] Deduced a trap composed of 16 places in 928 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1192 constraints, problems are : Problem set: 90 solved, 840 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 926/930 constraints, Known Traps: 5/5 constraints]
After SMT, in 62568ms problems are : Problem set: 90 solved, 840 unsolved
Search for dead transitions found 90 dead transitions in 62591ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 141/141 places, 841/931 transitions.
Reduce places removed 19 places and 280 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 122 transition count 561
Reduce places removed 10 places and 93 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 29 place count 112 transition count 468
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 110 transition count 452
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 109 transition count 447
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 106 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 106 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 38 rules in 20 ms. Remains 106 /141 variables (removed 35) and now considering 421/841 (removed 420) transitions.
[2024-05-21 23:05:52] [INFO ] Flow matrix only has 402 transitions (discarded 19 similar events)
// Phase 1: matrix 402 rows 106 cols
[2024-05-21 23:05:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 23:05:53] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 23:05:53] [INFO ] Flow matrix only has 402 transitions (discarded 19 similar events)
[2024-05-21 23:05:53] [INFO ] Invariant cache hit.
[2024-05-21 23:05:53] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 23:05:53] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/141 places, 421/931 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63725 ms. Remains : 106/141 places, 421/931 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2024-05-21 23:05:53] [INFO ] Flatten gal took : 113 ms
[2024-05-21 23:05:53] [INFO ] Flatten gal took : 125 ms
[2024-05-21 23:05:53] [INFO ] Input system was already deterministic with 2420 transitions.
Computed a total of 4 stabilizing places and 73 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 2420/2420 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
[2024-05-21 23:05:53] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
// Phase 1: matrix 2318 rows 228 cols
[2024-05-21 23:05:54] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 23:05:54] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 23:05:54] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 23:05:54] [INFO ] Invariant cache hit.
[2024-05-21 23:05:54] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-21 23:05:55] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 2418 sub problems to find dead transitions.
[2024-05-21 23:05:55] [INFO ] Flow matrix only has 2318 transitions (discarded 102 similar events)
[2024-05-21 23:05:55] [INFO ] Invariant cache hit.
[2024-05-21 23:05:55] [INFO ] State equation strengthened by 210 read => feed constraints.

BK_STOP 1716332763366

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-q8m002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q8m002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399400386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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