MCC'2025- Execution of r161-tall-174881260800155

About the Execution of ITS-Tools for PhilosophersDyn-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	127314.00	0.00	0.00	T	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r161-tall-174881260800155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is PhilosophersDyn-PT-10, examination is OneSafe
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-tall-174881260800155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.0M
-rw-r--r-- 1 mcc users 26K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 265K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 116K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 468K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 250K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 578K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME OneSafe

=== Now, execution of the tool begins

BK_START 1748856211727

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=OneSafe
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PhilosophersDyn-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
OneSafe PT
Running Version 202505121319
[2025-06-02 09:23:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, OneSafe, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-02 09:23:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:23:33] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2025-06-02 09:23:33] [INFO ] Transformed 170 places.
[2025-06-02 09:23:33] [INFO ] Transformed 2310 transitions.
[2025-06-02 09:23:33] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 303 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Normalized transition count is 1905 out of 2265 initially.
// Phase 1: matrix 1905 rows 170 cols
[2025-06-02 09:23:33] [INFO ] Computed 39 invariants in 82 ms
[2025-06-02 09:23:33] [INFO ] Rough structural analysis with invariants proved 118 places are one safe in 98 ms (including invariant computation).
Starting Z3 with timeout 100.0 s and query timeout 10000.0 ms
[2025-06-02 09:23:33] [INFO ] [Real]Absence check using 27 positive place invariants in 35 ms proved 0 places are One-Safe.
[2025-06-02 09:23:33] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 36 ms proved 42 places are One-Safe.
[2025-06-02 09:23:33] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2025-06-02 09:23:34] [INFO ] [Real] State equation constraints in 508 ms proved 0 places are One-Safe.
RANDOM walk for 40000 steps (4786 resets) in 4478 ms. (8 steps per ms) remains 52/52 properties
[2025-06-02 09:23:35] [INFO ] Flatten gal took : 510 ms
BEST_FIRST walk for 4004 steps (33 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (39 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (34 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (41 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
[2025-06-02 09:23:35] [INFO ] Flatten gal took : 164 ms
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (31 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
[2025-06-02 09:23:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2366678690059248791.gal : 78 ms
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (31 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
[2025-06-02 09:23:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5672452178959024577.prop : 0 ms
BEST_FIRST walk for 4004 steps (31 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2366678690059248791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5672452178959024577.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 52/52 properties

BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
Loading property file /tmp/ReachabilityCardinality5672452178959024577.prop.
SDD proceeding with computation,52 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,52 properties remain. new max is 8
SDD size :38 after 54
SDD proceeding with computation,52 properties remain. new max is 16
SDD size :54 after 90
SDD proceeding with computation,52 properties remain. new max is 32
SDD size :90 after 149
SDD proceeding with computation,52 properties remain. new max is 64
SDD size :149 after 226
SDD proceeding with computation,52 properties remain. new max is 128
SDD size :226 after 610
SDD proceeding with computation,52 properties remain. new max is 256
SDD size :610 after 1308
SDD proceeding with computation,52 properties remain. new max is 512
SDD size :1308 after 2633
Interrupted probabilistic random walk after 112523 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 52
Probabilistic random walk after 112523 steps, saw 29582 distinct states, run finished after 3008 ms. (steps per millisecond=37 ) properties seen :0
[2025-06-02 09:23:39] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2025-06-02 09:23:39] [INFO ] Computed 39 invariants in 49 ms
SDD proceeding with computation,52 properties remain. new max is 1024
SDD size :2633 after 4914
[2025-06-02 09:23:39] [INFO ] State equation strengthened by 1030 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem osplace_5 is UNSAT
Problem osplace_6 is UNSAT
Problem osplace_9 is UNSAT
Problem osplace_15 is UNSAT
Problem osplace_20 is UNSAT
Problem osplace_23 is UNSAT
Problem osplace_25 is UNSAT
Problem osplace_32 is UNSAT
Problem osplace_33 is UNSAT
Problem osplace_36 is UNSAT
Problem osplace_45 is UNSAT
Problem osplace_48 is UNSAT
Problem osplace_49 is UNSAT
Problem osplace_52 is UNSAT
Problem osplace_57 is UNSAT
Problem osplace_64 is UNSAT
Problem osplace_74 is UNSAT
Problem osplace_76 is UNSAT
Problem osplace_91 is UNSAT
Problem osplace_93 is UNSAT
Problem osplace_105 is UNSAT
Problem osplace_114 is UNSAT
Problem osplace_118 is UNSAT
Problem osplace_121 is UNSAT
Problem osplace_122 is UNSAT
Problem osplace_131 is UNSAT
Problem osplace_132 is UNSAT
Problem osplace_134 is UNSAT
Problem osplace_135 is UNSAT
Problem osplace_142 is UNSAT
Problem osplace_148 is UNSAT
Problem osplace_150 is UNSAT
Problem osplace_167 is UNSAT
Problem osplace_168 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/112 variables, 12/12 constraints. Problems are: Problem set: 34 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 34 solved, 18 unsolved
Problem osplace_44 is UNSAT
Problem osplace_50 is UNSAT
Problem osplace_82 is UNSAT
Problem osplace_92 is UNSAT
Problem osplace_110 is UNSAT
Problem osplace_128 is UNSAT
Problem osplace_149 is UNSAT
Problem osplace_156 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 53/165 variables, 25/37 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/37 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 5/170 variables, 2/39 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 42 solved, 10 unsolved
SDD proceeding with computation,52 properties remain. new max is 2048
SDD size :4914 after 7299
At refinement iteration 8 (INCLUDED_ONLY) 0/2075 variables, 1030/1239 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 42 solved, 10 unsolved
SDD proceeding with computation,52 properties remain. new max is 4096
SDD size :7299 after 8628
At refinement iteration 10 (OVERLAPS) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 42 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2075/2075 variables, and 1239 constraints, problems are : Problem set: 42 solved, 10 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1075/1085 variables, 10/10 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1085 variables, 0/10 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 990/2075 variables, 160/170 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2075 variables, 27/197 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2075 variables, 12/209 constraints. Problems are: Problem set: 42 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2075 variables, 1030/1239 constraints. Problems are: Problem set: 42 solved, 10 unsolved
SDD proceeding with computation,52 properties remain. new max is 8192
SDD size :8628 after 15971
At refinement iteration 7 (INCLUDED_ONLY) 0/2075 variables, 10/1249 constraints. Problems are: Problem set: 42 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 1249 constraints, problems are : Problem set: 42 solved, 10 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 10/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8500ms problems are : Problem set: 42 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 261 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2025-06-02 09:23:47] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2025-06-02 09:23:47] [INFO ] Invariant cache hit.
[2025-06-02 09:23:48] [INFO ] State equation strengthened by 1030 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD16 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2228 is UNSAT
SDD proceeding with computation,52 properties remain. new max is 16384
SDD size :15971 after 26511
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 134 solved, 2086 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2259 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 2040/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 380 solved, 1840 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 209 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 720/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46165ms problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 46185ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 124 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46601 ms. Remains : 170/170 places, 1885/2265 transitions.
RANDOM walk for 4000000 steps (477537 resets) in 62931 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (36698 resets) in 6558 ms. (609 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (36699 resets) in 6940 ms. (576 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (36659 resets) in 6841 ms. (584 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (36682 resets) in 6786 ms. (589 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (36726 resets) in 7005 ms. (570 steps per ms) remains 10/10 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,199051,79.3398,1882076,2,160831,18,2.20375e+06,58,0,3050,712724,0
Total reachable state count : 199051

Verifying 52 reachability properties.
Invariant property osplace_3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_3,0,79.3782,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_5,0,79.4302,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_6,0,79.4752,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_9,0,79.5296,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_13,0,79.559,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_15,0,79.5797,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_20 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_20,0,79.6129,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_23 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_23,0,79.7066,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_25 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_25,0,79.7565,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_31 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_31,0,79.8481,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_32 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_32,0,79.9079,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_33 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_33,0,80.0827,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_35 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_35,0,80.1166,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_36 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_36,0,80.1589,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_44 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_44,0,80.227,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_45 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_45,0,80.2318,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_47 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_47,0,80.2702,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_48 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_48,0,80.3428,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_49 is true.

BEST_FIRST walk for 4000004 steps (36687 resets) in 7118 ms. (561 steps per ms) remains 10/10 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_49,0,80.3792,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_50 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_50,0,80.4279,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_52 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_52,0,80.5125,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_57 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_57,0,80.5334,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_64 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_64,0,80.5587,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_74 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_74,0,80.5861,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_76 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_76,0,80.5976,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_82 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_82,0,80.6147,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_91 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_91,0,80.6382,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_92 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_92,0,80.8214,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_93 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_93,0,80.8586,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_97 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_97,0,80.9248,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_105 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_105,0,81.0022,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_108 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_108,0,81.0691,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_110 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_110,0,81.1011,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_114 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_114,0,81.1854,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_118 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_118,0,81.1934,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_121 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_121,0,81.2333,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_122 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_122,0,81.3069,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_127 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_127,0,81.3854,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_128 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_128,0,81.4641,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_131 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_131,0,81.5296,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_132 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_132,0,81.5355,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_134 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_134,0,81.5892,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_135 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_135,0,81.7832,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_140 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_140,0,81.8441,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_142 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_142,0,81.8528,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_146 is true.

BEST_FIRST walk for 4000004 steps (36694 resets) in 6518 ms. (613 steps per ms) remains 10/10 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_146,0,81.9896,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_148 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_148,0,82.098,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_149 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_149,0,82.1982,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_150 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_150,0,82.3297,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_156 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_156,0,82.3335,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_167 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_167,0,82.4573,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
Invariant property osplace_168 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
osplace\_168,0,82.8834,1882076,1,0,18,2.20375e+06,58,0,3051,712724,0
BEST_FIRST walk for 4000004 steps (36702 resets) in 6356 ms. (629 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (36673 resets) in 5322 ms. (751 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (36662 resets) in 5358 ms. (746 steps per ms) remains 10/10 properties
Probably explored full state space saw : 199046 states, properties seen :0
Probabilistic random walk after 816332 steps, saw 199046 distinct states, run finished after 15468 ms. (steps per millisecond=52 ) properties seen :0
Explored full state space saw : 199051 states, properties seen :0
Exhaustive walk after 816356 steps, saw 199051 distinct states, run finished after 15276 ms. (steps per millisecond=53 ) properties seen :0
Able to resolve query OneSafe after proving 212 properties.
FORMULA OneSafe TRUE TECHNIQUES EXHAUSTIVE_WALK DECISION_DIAGRAMS INVARIANTS SMT_REFINEMENT COLLATERAL_PROCESSING TOPOLOGICAL SAT_SMT STRUCTURAL
Total runtime 126014 ms.

BK_STOP 1748856339041

--------------------
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
+ [[ OneSafe = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution OneSafe -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination OneSafe -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="OneSafe"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-10, examination is OneSafe"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-tall-174881260800155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
if [ "OneSafe" = "ReachabilityDeadlock" ] || [ "OneSafe" = "UpperBounds" ] || [ "OneSafe" = "QuasiLiveness" ] || [ "OneSafe" = "StableMarking" ] || [ "OneSafe" = "Liveness" ] || [ "OneSafe" = "OneSafe" ] || [ "OneSafe" = "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 [ "OneSafe" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "OneSafe" != "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 "OneSafe.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 '' OneSafe.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "OneSafe" = "ReachabilityDeadlock" ] || [ "OneSafe" = "QuasiLiveness" ] || [ "OneSafe" = "StableMarking" ] || [ "OneSafe" = "Liveness" ] || [ "OneSafe" = "OneSafe" ] ; then
echo "FORMULA_NAME OneSafe"
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 ;