Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063700214.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 Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063700214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 25M 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 Dekker-PT-200-ReachabilityCardinality-2023-03
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2023-05
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-00
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-01
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-02
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-04
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-06
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-08
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-09
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-10
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-11
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-12
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-13
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-14
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748648859560

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 23:47:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 23:47:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:47:44] [INFO ] Load time of PNML (sax parser for PT used): 2061 ms
[2025-05-30 23:47:44] [INFO ] Transformed 1000 places.
[2025-05-30 23:47:45] [INFO ] Transformed 40400 transitions.
[2025-05-30 23:47:45] [INFO ] Found NUPN structural information;
[2025-05-30 23:47:45] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 2559 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 10184 ms. (3 steps per ms) remains 5/12 properties
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1134 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 922 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 789 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 601 ms. (66 steps per ms) remains 5/5 properties
[2025-05-30 23:47:50] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2025-05-30 23:47:50] [INFO ] Computed 600 invariants in 63 ms
[2025-05-30 23:47:50] [INFO ] State equation strengthened by 200 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 23:47:50] [INFO ] Flatten gal took : 3389 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 122/186 variables, 79/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 122/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/201 variables, 15/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 67/268 variables, 56/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 67/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 22/290 variables, 22/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 22/464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 232/522 variables, 290/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 284/806 variables, 200/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 852/1658 variables, 568/1522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1658 variables, 568/2090 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1658 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-05-30 23:47:52] [INFO ] Flatten gal took : 1988 ms
At refinement iteration 22 (OVERLAPS) 142/1800 variables, 284/2374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1800 variables, 142/2516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 142/2658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 142/2800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-05-30 23:47:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10510347240420667199.gal : 372 ms
[2025-05-30 23:47:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16260244579192348692.prop : 3 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/ReachabilityCardinality10510347240420667199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16260244579192348692.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
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2901 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 122/186 variables, 79/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 122/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:55] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:55] [INFO ] Deduced a trap composed of 4 places in 550 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:56] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:56] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:57] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:57] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:58] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:58] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 15 ms to minimize.
SMT process timed out in 8634ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 2753 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2790 ms. Remains : 1000/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 5381 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 766 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 986 ms. (40 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality16260244579192348692.prop.
Interrupted probabilistic random walk after 170448 steps, run timeout after 6003 ms. (steps per millisecond=28 ) properties seen :0 out of 5
Probabilistic random walk after 170448 steps, saw 164324 distinct states, run finished after 6014 ms. (steps per millisecond=28 ) properties seen :0
[2025-05-30 23:48:10] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2025-05-30 23:48:10] [INFO ] Invariant cache hit.
[2025-05-30 23:48:10] [INFO ] State equation strengthened by 200 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 122/186 variables, 79/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 122/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/201 variables, 15/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 67/268 variables, 56/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 67/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 22/290 variables, 22/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 22/464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 232/522 variables, 290/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 284/806 variables, 200/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 852/1658 variables, 568/1522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1658 variables, 568/2090 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1658 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 142/1800 variables, 284/2374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1800 variables, 142/2516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 142/2658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 142/2800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2395 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 122/186 variables, 79/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 122/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:13] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:14] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:14] [INFO ] Deduced a trap composed of 4 places in 635 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:15] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:15] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:16] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:16] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:16] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:17] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:17] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:17] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:18] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:18] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:19] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:19] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:20] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:20] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:20] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:21] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:21] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:22] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:22] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:22] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:23] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:23] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:23] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:24] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:24] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:24] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:25] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:25] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:25] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:26] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:26] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:26] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:27] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:27] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:27] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:27] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:28] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:28] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:28] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:29] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:29] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:29] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:30] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:30] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:30] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:30] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:31] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:31] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:31] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:31] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:32] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:32] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:32] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:33] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 15/201 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:34] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:34] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:34] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:34] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:35] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:35] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:35] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:35] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:35] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:36] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:36] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:36] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:36] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:36] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:37] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:37] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:37] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:37] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:37] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:38] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:38] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:38] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:38] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:38] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:39] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:39] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:39] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:39] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:39] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:39] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:40] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:40] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:40] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:40] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:40] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:41] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 16/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 67/268 variables, 56/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 67/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 22/290 variables, 22/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/290 variables, 22/557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:42] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:42] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:42] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:43] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:43] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:44] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:44] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:44] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:45] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:45] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:46] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:46] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:47] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:47] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:47] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 15/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 232/522 variables, 290/862 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:48:49] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/522 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/522 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 284/806 variables, 200/1063 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/806 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 852/1658 variables, 568/1631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1658 variables, 568/2199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1658 variables, 3/2202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :16 after 128
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :128 after 8192
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8192 after 1.67772e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.67772e+07 after 7.03687e+13
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :7.03687e+13 after 6.1897e+26
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :6.1897e+26 after 4.78905e+52
[2025-05-30 23:48:58] [INFO ] Deduced a trap composed of 4 places in 2342 ms of which 37 ms to minimize.
SMT process timed out in 47977ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 990 ms.
Support contains 64 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Invariant property Dekker-PT-200-ReachabilityCardinality-2025-14 does not hold.
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property Dekker-PT-200-ReachabilityCardinality-2025-11 is true.
FORMULA Dekker-PT-200-ReachabilityCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property Dekker-PT-200-ReachabilityCardinality-2024-07 does not hold.
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Applied a total of 0 rules in 1821 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1822 ms. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1530 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2025-05-30 23:49:02] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2025-05-30 23:49:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:49:33] [INFO ] Performed 240/1000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-30 23:50:03] [INFO ] Performed 794/1000 implicitness test of which 126 returned IMPLICIT in 60 seconds.
[2025-05-30 23:50:04] [INFO ] Implicit Places using invariants in 61916 ms returned [400, 406, 409, 412, 415, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 541, 544, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 844, 847, 850, 853, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 61982 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 810/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1220 ms. Remains 810 /810 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64741 ms. Remains : 810/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 4158 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 94671 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 2
Probabilistic random walk after 94671 steps, saw 91543 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2025-05-30 23:50:10] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 810 cols
[2025-05-30 23:50:10] [INFO ] Computed 410 invariants in 11 ms
[2025-05-30 23:50:10] [INFO ] State equation strengthened by 200 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 101/160 variables, 65/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 101/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 52/212 variables, 41/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 52/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/222 variables, 10/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/434 variables, 222/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 294/728 variables, 200/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/728 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 735/1463 variables, 441/1201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1463 variables, 441/1642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1463 variables, 147/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1463 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 147/1610 variables, 147/1936 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 147/2083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 147/2230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 2230 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1593 ms.
Refiners :[Domain max(s): 810/810 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 810/810 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 2/0 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/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 101/160 variables, 65/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 101/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:12] [INFO ] Deduced a trap composed of 4 places in 726 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:13] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:14] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:14] [INFO ] Deduced a trap composed of 4 places in 550 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:15] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:15] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:15] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:16] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:16] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:17] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:17] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:17] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:18] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:18] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:18] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:19] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:19] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:19] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:20] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:20] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:21] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:21] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:22] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:22] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:22] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:23] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:23] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:23] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:24] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:24] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:24] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:25] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:25] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:25] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:26] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:26] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:26] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:26] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 18/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 52/212 variables, 41/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 52/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:28] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:28] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:28] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:28] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:29] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:29] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:29] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:29] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:30] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:30] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:30] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:30] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:31] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:31] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:31] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:31] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:32] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:32] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:32] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:32] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/222 variables, 10/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 10/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 212/434 variables, 222/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:33] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:50:34] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 294/728 variables, 200/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/728 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 735/1463 variables, 441/1261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1463 variables, 441/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1463 variables, 147/1849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1463 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 147/1610 variables, 147/1996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 147/2143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 147/2290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1610 variables, 0/2290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1610 variables, 0/2290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 2290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25773 ms.
Refiners :[Domain max(s): 810/810 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 810/810 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27463ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 451 ms.
Support contains 59 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 40400/40400 transitions.
Applied a total of 0 rules in 904 ms. Remains 810 /810 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 810/810 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 40400/40400 transitions.
Applied a total of 0 rules in 884 ms. Remains 810 /810 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2025-05-30 23:50:39] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2025-05-30 23:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:50:49] [INFO ] Implicit Places using invariants in 9824 ms returned []
Implicit Place search using SMT only with invariants took 9829 ms to find 0 implicit places.
Running 40200 sub problems to find dead transitions.
[2025-05-30 23:50:50] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2025-05-30 23:50:50] [INFO ] Invariant cache hit.
[2025-05-30 23:50:50] [INFO ] State equation strengthened by 200 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 40200 unsolved
SMT process timed out in 147770ms, After SMT, problems are : Problem set: 0 solved, 40200 unsolved
Search for dead transitions found 0 dead transitions in 148039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159010 ms. Remains : 810/810 places, 40400/40400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1250 edges and 810 vertex of which 222 are kept as prefixes of interest. Removing 588 places using SCC suffix rule.17 ms
Discarding 588 places :
Also discarding 29694 output transitions
Drop transitions (Output transitions of discarded places.) removed 29694 transitions
Ensure Unique test removed 10 places
Ensure Unique test removed 10494 transitions
Reduce isomorphic transitions removed 10494 transitions.
Iterating post reduction 0 with 10504 rules applied. Total rules applied 10505 place count 212 transition count 212
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 10544 place count 186 transition count 199
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 10557 place count 186 transition count 186
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 10583 place count 186 transition count 160
Ensure Unique test removed 26 places
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 10661 place count 134 transition count 134
Applied a total of 10661 rules in 672 ms. Remains 134 /810 variables (removed 676) and now considering 134/40400 (removed 40266) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 134 rows 134 cols
[2025-05-30 23:53:18] [INFO ] Computed 67 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 23:53:18] [INFO ] After 84ms 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-05-30 23:53:18] [INFO ] [Nat]Absence check using 67 positive place invariants in 17 ms returned sat
[2025-05-30 23:53:19] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 23:53:19] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 23:53:19] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-30 23:53:19] [INFO ] Flatten gal took : 15 ms
[2025-05-30 23:53:19] [INFO ] Flatten gal took : 6 ms
[2025-05-30 23:53:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11759841844113387095.gal : 5 ms
[2025-05-30 23:53:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1943447881030962413.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/ReachabilityCardinality11759841844113387095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1943447881030962413.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/ReachabilityCardinality1943447881030962413.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 288
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :288 after 147456
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :147456 after 6.1153e+09
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,2.62947e+18,0.045701,4984,2,216,9,1526,8,0,764,562,0
Total reachable state count : 2629465015396073472

Verifying 2 reachability properties.
Reachability property Dekker-PT-200-ReachabilityCardinality-2023-03 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
Dekker-PT-200-ReachabilityCardinality-2023-03,2,0.048209,4984,2,136,9,1526,8,0,782,562,0
Reachability property Dekker-PT-200-ReachabilityCardinality-2023-05 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
Dekker-PT-200-ReachabilityCardinality-2023-05,7.62836e+16,0.365976,20440,2,44095,9,80003,8,0,845,91431,0
Over-approximation ignoring read arcs solved 0 properties in 1619 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 23:53:22] [INFO ] Flatten gal took : 3017 ms
[2025-05-30 23:53:22] [INFO ] Applying decomposition
[2025-05-30 23:53:24] [INFO ] Flatten gal took : 2007 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/graph9232397006801182955.txt' '-o' '/tmp/graph9232397006801182955.bin' '-w' '/tmp/graph9232397006801182955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9232397006801182955.bin' '-l' '-1' '-v' '-w' '/tmp/graph9232397006801182955.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:53:32] [INFO ] Decomposing Gal with order
[2025-05-30 23:53:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:53:39] [INFO ] Removed a total of 137506 redundant transitions.
[2025-05-30 23:53:39] [INFO ] Flatten gal took : 3481 ms
[2025-05-30 23:53:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2347 ms.
[2025-05-30 23:53:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality936370951901462960.gal : 224 ms
[2025-05-30 23:53:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7776074897662229547.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/ReachabilityCardinality936370951901462960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7776074897662229547.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 ...306
Loading property file /tmp/ReachabilityCardinality7776074897662229547.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 512
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :512 after 1.60694e+60
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1.60694e+60 after 1.60694e+60
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.62301e+62,56.5961,269616,418,15,20572,20336,41369,13077,50,30688,0
Total reachable state count : 1.623007424701580178297381713264574228547e+62

Verifying 2 reachability properties.
Reachability property Dekker-PT-200-ReachabilityCardinality-2023-03 is true.
FORMULA Dekker-PT-200-ReachabilityCardinality-2023-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-2023-03,3.76626e+58,56.63,269616,236,16,20572,20336,41393,13077,59,30688,1351
Reachability property Dekker-PT-200-ReachabilityCardinality-2023-05 is true.
FORMULA Dekker-PT-200-ReachabilityCardinality-2023-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-2023-05,3.92319e+56,56.6641,269616,218,16,20572,20336,41455,13077,61,30688,5655
All properties solved without resorting to model-checking.
Total runtime 421732 ms.

BK_STOP 1748649284851

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityCardinality"
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 Dekker-PT-200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063700214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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