fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r184-tall-174889263700191
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ResAllocation-PT-R100C002

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889263700191.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 ResAllocation-PT-R100C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889263700191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 6.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 422K 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748973634731

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 18:00:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 18:00:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:00:36] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-03 18:00:36] [INFO ] Transformed 400 places.
[2025-06-03 18:00:36] [INFO ] Transformed 202 transitions.
[2025-06-03 18:00:36] [INFO ] Found NUPN structural information;
[2025-06-03 18:00:36] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 18:00:36] [INFO ] Flatten gal took : 124 ms
RANDOM walk for 40000 steps (12 resets) in 1659 ms. (24 steps per ms) remains 9/16 properties
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 18:00:36] [INFO ] Flatten gal took : 55 ms
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 9/9 properties
[2025-06-03 18:00:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16184974353303918157.gal : 27 ms
[2025-06-03 18:00:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11234060606092638176.prop : 9 ms
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/ReachabilityCardinality16184974353303918157.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11234060606092638176.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...330
Loading property file /tmp/ReachabilityCardinality11234060606092638176.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :448 after 14336
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :14336 after 1.67772e+07
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1.67772e+07 after 7.03687e+13
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
// Phase 1: matrix 202 rows 400 cols
[2025-06-03 18:00:37] [INFO ] Computed 200 invariants in 13 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 31/220 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 140/329 variables, 124/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 140/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 19/348 variables, 19/503 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 19/522 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 184/532 variables, 348/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 42/574 variables, 32/902 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 32/934 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 16/950 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 18/592 variables, 12/962 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/592 variables, 12/974 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/592 variables, 6/980 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 10/602 variables, 8/988 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/602 variables, 8/996 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 4/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/602 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 1000 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2584 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 31/220 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 140/329 variables, 124/346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 140/486 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Problem ResAllocation-PT-R100C002-ReachabilityFireability-2025-12 is UNSAT
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 15/501 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 19/348 variables, 19/520 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 19/539 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/539 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 184/532 variables, 348/887 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 5/892 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 2/894 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 1/895 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 3/898 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/898 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 42/574 variables, 32/930 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 32/962 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 16/978 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 1/979 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/602 variables, and 979 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5014 ms.
Refiners :[Domain max(s): 380/400 constraints, Positive P Invariants (semi-flows): 190/200 constraints, State Equation: 380/400 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7691ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 398 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 398 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 396 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 394 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 394 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 392 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 390 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 390 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 388 transition count 196
Applied a total of 18 rules in 100 ms. Remains 388 /400 variables (removed 12) and now considering 196/202 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 388/400 places, 196/202 transitions.
RANDOM walk for 40000 steps (16 resets) in 726 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 616109 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :4 out of 8
Probabilistic random walk after 616109 steps, saw 157373 distinct states, run finished after 3005 ms. (steps per millisecond=205 ) properties seen :4
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 196 rows 388 cols
[2025-06-03 18:00:48] [INFO ] Computed 194 invariants in 6 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 141/308 variables, 118/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 141/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 24/332 variables, 24/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 24/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 180/512 variables, 332/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 56/568 variables, 44/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 44/918 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 22/940 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 12/580 variables, 8/948 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/580 variables, 8/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/580 variables, 4/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/580 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/584 variables, 4/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 4/968 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/584 variables, 2/970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 970 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1656 ms.
Refiners :[Domain max(s): 388/388 constraints, Positive P Invariants (semi-flows): 194/194 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 141/308 variables, 118/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 141/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 11/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 24/332 variables, 24/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 24/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/512 variables, 332/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 3/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 56/568 variables, 44/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 44/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 22/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/568 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/568 variables, 6/966 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/568 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/568 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 12/580 variables, 8/975 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/580 variables, 8/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/580 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/580 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 4/584 variables, 4/991 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/584 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/584 variables, 2/997 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/584 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/584 variables, 1/999 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 999 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45016 ms.
Refiners :[Domain max(s): 388/388 constraints, Positive P Invariants (semi-flows): 194/194 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46704ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 196/196 transitions.
Applied a total of 0 rules in 21 ms. Remains 388 /388 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 388/388 places, 196/196 transitions.
RANDOM walk for 40000 steps (16 resets) in 363 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/4 properties
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-03 18:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/211 variables, 87/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 118/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/236 variables, 25/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 25/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 150/386 variables, 236/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 138/524 variables, 104/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 104/798 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 52/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 52/576 variables, 40/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/576 variables, 40/930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/576 variables, 20/950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/576 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/584 variables, 8/958 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 8/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/584 variables, 4/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 970 constraints, problems are : Problem set: 0 solved, 2 unsolved in 718 ms.
Refiners :[Domain max(s): 388/388 constraints, Positive P Invariants (semi-flows): 194/194 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 118/211 variables, 87/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 118/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 10/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 25/236 variables, 25/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 25/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 150/386 variables, 236/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 138/524 variables, 104/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 104/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 52/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/524 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/576 variables, 40/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/576 variables, 40/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/576 variables, 20/963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/584 variables, 8/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/584 variables, 8/979 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/584 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/584 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/584 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 983 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3709 ms.
Refiners :[Domain max(s): 388/388 constraints, Positive P Invariants (semi-flows): 194/194 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4438ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2035 ms.
Support contains 93 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 196/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 386 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 386 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 384 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 382 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 382 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 380 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 378 transition count 191
Applied a total of 15 rules in 60 ms. Remains 378 /388 variables (removed 10) and now considering 191/196 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 378/388 places, 191/196 transitions.
RANDOM walk for 40000 steps (16 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 778276 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 2
Probabilistic random walk after 778276 steps, saw 193229 distinct states, run finished after 3003 ms. (steps per millisecond=259 ) properties seen :0
// Phase 1: matrix 191 rows 378 cols
[2025-06-03 18:01:45] [INFO ] Computed 189 invariants in 5 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 117/210 variables, 87/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 117/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/234 variables, 24/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 24/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 149/383 variables, 234/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/515 variables, 100/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 100/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 50/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/561 variables, 36/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 36/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 18/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/569 variables, 8/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/569 variables, 8/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/569 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/569 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 945 constraints, problems are : Problem set: 0 solved, 2 unsolved in 739 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 189/189 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 117/210 variables, 87/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 117/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/234 variables, 24/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 24/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 149/383 variables, 234/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 132/515 variables, 100/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 100/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 50/844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/515 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 46/561 variables, 36/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/561 variables, 36/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/561 variables, 18/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/561 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 8/569 variables, 8/942 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/569 variables, 8/950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/569 variables, 4/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/569 variables, 2/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/569 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/569 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 956 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2129 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 189/189 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2884ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2115 ms.
Support contains 93 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 191/191 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 378/378 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2025-06-03 18:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:01:51] [INFO ] Implicit Places using invariants in 234 ms returned [191, 193, 195, 197, 201, 207, 209, 211, 215, 217, 219, 221, 223, 225, 227, 229, 233, 237, 239, 241, 243, 247, 249, 251, 257, 259, 261, 263, 267, 269, 271, 273, 275, 277, 279, 281, 285, 287, 289, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 319, 321, 323, 325, 327, 329, 331, 335, 337, 339, 341, 343, 347, 349, 351, 353, 355, 357, 359, 361, 365, 369, 371, 373]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 243 ms to find 74 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/378 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 304 /304 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 256 ms. Remains : 304/378 places, 191/191 transitions.
RANDOM walk for 40000 steps (16 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 810935 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 2
Probabilistic random walk after 810935 steps, saw 200528 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
// Phase 1: matrix 191 rows 304 cols
[2025-06-03 18:01:54] [INFO ] Computed 115 invariants in 1 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/196 variables, 73/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 103/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/345 variables, 196/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 107/452 variables, 75/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 75/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 25/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 37/489 variables, 27/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 27/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/489 variables, 9/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/489 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/495 variables, 6/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/495 variables, 6/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/495 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/495 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/495 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 723 constraints, problems are : Problem set: 0 solved, 2 unsolved in 592 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 103/196 variables, 73/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 103/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 9/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 149/345 variables, 196/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 107/452 variables, 75/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 75/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 25/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 37/489 variables, 27/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/489 variables, 27/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 9/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 6/495 variables, 6/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/495 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/495 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/495 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/495 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/495 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/495 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:01:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/495 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/495 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/495 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 740 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5688 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6290ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1689 ms.
Support contains 93 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 304 /304 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 304/304 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 304 /304 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2025-06-03 18:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:02:02] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-03 18:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:02:02] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:02:02] [INFO ] Redundant transitions in 7 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-03 18:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 303/303 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 114/417 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:06] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:08] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:08] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:14] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:14] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:14] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 12/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 1/304 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 191/495 variables, 304/815 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/495 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 815 constraints, problems are : Problem set: 0 solved, 189 unsolved in 29028 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 303/303 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 114/417 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 92/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/304 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 191/495 variables, 304/815 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 189/1004 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 1004 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30025 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59074ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 59076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59582 ms. Remains : 304/304 places, 191/191 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 304 /304 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-06-03 18:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 18:03:01] [INFO ] [Real]Absence check using 115 positive place invariants in 20 ms returned sat
[2025-06-03 18:03:01] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 18:03:02] [INFO ] [Nat]Absence check using 115 positive place invariants in 12 ms returned sat
[2025-06-03 18:03:02] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2025-06-03 18:03:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 621 ms
TRAPS : Iteration 1
[2025-06-03 18:03:03] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 18:03:03] [INFO ] After 1194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 18:03:03] [INFO ] Flatten gal took : 17 ms
[2025-06-03 18:03:03] [INFO ] Flatten gal took : 20 ms
[2025-06-03 18:03:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18007727776348882049.gal : 2 ms
[2025-06-03 18:03:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4259247359161979074.prop : 0 ms
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/ReachabilityCardinality18007727776348882049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4259247359161979074.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality4259247359161979074.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :448 after 14336
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14336 after 1.67772e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.67772e+07 after 7.03687e+13
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7.03687e+13 after 1.0832e+27
Detected timeout of ITS tools.
[2025-06-03 18:03:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 18:03:18] [INFO ] Applying decomposition
[2025-06-03 18:03:18] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9306806237417765055.txt' '-o' '/tmp/graph9306806237417765055.bin' '-w' '/tmp/graph9306806237417765055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9306806237417765055.bin' '-l' '-1' '-v' '-w' '/tmp/graph9306806237417765055.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:03:18] [INFO ] Decomposing Gal with order
[2025-06-03 18:03:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:03:18] [INFO ] Flatten gal took : 50 ms
[2025-06-03 18:03:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 18:03:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16322905247685397488.gal : 5 ms
[2025-06-03 18:03:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3714450267031282244.prop : 1 ms
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/ReachabilityCardinality16322905247685397488.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3714450267031282244.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality3714450267031282244.prop.
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\_mod\_flat,1.90148e+30,0.311233,18252,246,11,36578,75,516,39872,26,100,0
Total reachable state count : 1901475900342344102245054808064

Verifying 2 reachability properties.
Reachability property ResAllocation-PT-R100C002-ReachabilityFireability-2025-03 does not hold.
No reachable states exhibit your property : ResAllocation-PT-R100C002-ReachabilityFireability-2025-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityFireability-2025-03,0,0.312176,18380,1,0,36578,75,535,39872,29,100,34
Invariant property ResAllocation-PT-R100C002-ReachabilityFireability-2025-09 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
ResAllocation-PT-R100C002-ReachabilityFireability-2025-09,0,0.318375,18380,1,0,36578,75,811,39872,33,100,1375
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-09 TRUE TECHNIQUES OVER_APPROXIMATION
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-2025-03 FALSE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -2 properties in 16948 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 162951 ms.

BK_STOP 1748973798829

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R100C002, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889263700191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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